Search Results for author:
Found 4 papers, 0 papers with code
Stable Matching with Ties: Approximation Ratios and Learning
We aim to guarantee each worker the largest possible share from the utility in her best possible stable matching.
Equitable Auctions
We initiate the study of how auction design affects the division of surplus among buyers.
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
The latter one almost matches our lower bound of $\frac{K}{2K-1}$ for a matroid constraint, which almost settles the approximation ratio for a matroid constraint that can be obtained by a streaming algorithm whose space complexity is independent of $n$.
How to aggregate Top-lists: Approximation algorithms via scores and average ranks
* Using average ranks, we generalize and analyze Borda's algorithm for rank aggregation.
