5.2k citations
- Courant Institute of Mathematical SciencesUS5 papers
- University of Illinois Urbana-ChampaignUS4 papers
- New York UniversityUS3 papers
- Bharathidasan UniversityIN2 papers
- Columbia UniversityUS2 papers
- Cornell UniversityUS2 papers
- Laboratory for Atmospheric and Space PhysicsUS2 papers
- Massachusetts Institute of TechnologyUS2 papers
- Microsoft Research (India)IN2 papers
- Tel Aviv UniversityIL2 papers
- The University of TokyoJP2 papers
- University of California, DavisUS2 papers
Showing 2010 · cs.GTShow all
3 papers · 2 filters
cs.GT2010
Inner Product Spaces for MinSum Coordination Mechanisms
Richard Cole, José R. Correa, Vasilis Gkatzelis +2
We study policies aiming to minimize the weighted sum of completion times of jobs in the context of coordination mechanisms for selfish scheduling problems. Our goal is to design l…
cs.GT2010★ 5 cited
Approximation Schemes for Sequential Posted Pricing in Multi-Unit Auctions
Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha +2
We design algorithms for computing approximately revenue-maximizing {\em sequential posted-pricing mechanisms (SPM)} in -unit auctions, in a standard Bayesian model. A seller ha…
cs.GT2010★ 3 cited
Robust Mechanisms for Risk-Averse Sellers
Mukund Sundararajan, Qiqi Yan
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good m…