Balloon popping with applications to ascending auctions

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 104-112

  Immorlica, Nicole ^a   Karlin, Anna R ^b   Mahdian, Mohammad ^c   Talwar, Kunal ^d  

^a CWI   (Netherlands)

^b UNIVERSITY OF WASHINGTON   (United States)

^c YAHOO RESEARCH   (United States)

^d MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BALLOONS; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; INDUSTRIAL ECONOMICS;

FIXED PRICE (FP); IN ORDER; OPTIMAL STRATEGIES;

COMMERCE;

EID: 46749108075     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389484     Document Type: Conference Paper

References (17)

1. Zoë Abrams. Revenue maximization when bidders have budgets. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.
2. Ziv Bar-Yossef, Kirsten Hildrum, and Felix Wu. Incentive-compatible online auctions for digital goods. In Proceedings of 13th ACM Symposium on Discrete Algorithms (SODA), 2002.
3. James Bergin and Lin Zhou. Optimal uniform pricing procedures. manuscript.
4. Avrim Blum and Jason Hartline. Near-optimal online auctions. In Proceedings of 16th ACM Symposium on Discrete Algorithms (SODA), 2005.
5. Avrim Blum, Vijay Kumar, Atri Rudra, and Felix Wu. Online learning in online auctions. In Proceedings of 14th ACM Symposium on Discrete Algorithms (SODA), 2003.
6. Christian Borgs, Jennifer Chayes, Nicole Immorlica, Mohammad Mahdian, and Amin Saberi. Multi-unit auctions with budget-constrained bidders. In Proceedings of the 6th ACM Conference on Electronic Commerce (EC), pages 44-51, 2005.
7. Jeremy Bulow and John Roberts. The simple economics of optimal auctions. Journal of Political Economy, 97:1060-1090, 1990.
8. Jacques Cremer and Richard McLean. Optimal selling strategies under uncertainty for a discriminating monopolist when demands are interdependent. Econometrica, 53(2):345-361, 1985.
9. Kaustubh Deshmukh, Andrew Goldberg, Jason Hartline, and Anna Karlin. Truthful and competitive double auctions. In Proceedings of 10th Annual European Symposium on Algorithms (ESA), 2002.
10. Andrew Goldberg and Jason Hartline. Competitiveness via consensus. In Proceedings of 14th ACM Symposium on Discrete Algorithms (SODA), 2003.
11. Andrew Goldberg, Jason Hartline, Anna Karlin, Mike Saks, and Andrew Wright. Competitive auctions. Games and Economic Behavior, 55(2):242-269, May 2006.
12. Andrew Goldberg, Jason Hartline, and Andrew Wright. Competitive auctions and digital goods. In Proceedings of 12th ACM Symposium on Discrete Algorithms (SODA), 2001.
13. Jason Hartline. Optimization in the Private Value Model: Competitive Analysis Applied to Auction Design. PhD thesis, University of Washington, 2003.
14. Robert Kleinberg and Tom Leighton. The value of knowing a demand curve: Bounds on regret for online posted-price auctions. In Proceedings of 14th ACM Symposium on Discrete Algorithms (SODA), 2003.
15. Hervé Moulin. Incremental cost sharing: Characterization by coalition strategy-proofness. Social Choice and Welfare, 16:279-320, 1999.
16. Roger Myerson. Optimal auction design. Mathematics of Operations Research, 6:58-73, 1981.
17. David Parkes. Online mechanisms. In Algorithmic Game Theory, chapter 16. Cambridge University Press, 2007. Editors: N. Nisan and T. Roughgarden and E. Tardos and V. Vazirani. In press.