• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Revenue Submodularity (2009)

Cached

  • Download as a PDF

Download Links

  • [www.cs.stanford.edu]
  • [theory.stanford.edu]
  • [theory.stanford.edu]
  • [www.cs.stanford.edu]
  • [theoryofcomputing.org]
  • [theory.stanford.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Shaddin Dughmi , Tim Roughgarden , Mukund Sundararajan
Venue:EC'09
Citations:9 - 6 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Dughmi09revenuesubmodularity,
    author = {Shaddin Dughmi and Tim Roughgarden and Mukund Sundararajan},
    title = {Revenue Submodularity },
    year = {2009}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We introduce revenue submodularity, the property that market expansion has diminishing returns on an auction’s expected revenue. We prove that revenue submodularity is generally possible only in matroid markets, that Bayesian-optimal auctions are always revenue-submodular in such markets, and that the VCG mechanism is revenue-submodular in matroid markets with i.i.d. bidders and “sufficient competition”. We also give two applications of revenue submodularity: good approximation algorithms for novel market expansion problems, and approximate revenue guarantees for the VCG mechanism with i.i.d. bidders.

Citations

8882 Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
659 Optimal Auction Design - Myerson - 1981
398 Matroid Theory - Oxley - 1992
282 Matroid Theory - Welsh - 1976
252 An analysis of the approximations for maximizing submodular set functions - Nemhauser, Wosley, et al. - 1978
242 Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords - Edelman, Ostrovsky, et al.
163 Putting Auction Theory to Work - Milgrom
137 Position auctions - Varian - 2007
114 The design and analysis of algorithms - Kozen - 1991
95 Ascending auctions with package bidding - Ausubel, Milgrom
79 Truthful Auctions for Pricing Search Keywords, EC - Aggarwal, Goel, et al. - 2006
61 Auctions versus Negotiations - Bulow, Klemperer - 1996
50 The intractability of computing the minimum distance of a code - Vardy - 1997
47 Maximizing Non-Monotone Submodular Functions, Uriel Feige, Vahab - Mirrokni, Vondrak
45 Optimal approximation for the submodular welfare problem in the value oracle model - Vondrák - 2008
43 Maximizing a submodular set function subject to a matroid constraint - Calinescu, Chekuri, et al.
34 Beyond VCG: Frugality of truthful mechanisms - Karlin, Kempe, et al. - 2005
33 The price of truth: Frugality in truthful mechanisms - Talwar - 2003
18 Revenue monotonicity in combinatorial auctions. SIGecom Exchanges - Rastegari, Condon, et al.
16 AND RAJEEV MOTWANI: Truthful auctions for pricing search keywords - AGGARWAL, GOEL - 2006
16 secretary problems, and online mechanisms - BABAIOFF, IMMORLICA, et al. - 2007
13 Revisiting the greedy approach to submodular set function maximization - GOUNDAN, SCHULZ - 2009
12 The effectiveness of English auctions - Neeman - 2003
11 secretary problems, and online mechanisms - Matroids - 2007
11 Optimal Auction design in a multi-unit environment: The case of sponsored search auctions.ACM - Edelman, Schwarz - 2007
7 PÁL: An online mechanism for ad slot reservations with cancellations - CONSTANTIN, FELDMAN, et al. - 2009
7 Reserve Prices in Internet Advertising Auctions: A Field Experiment,” 2009. Working Paper - Ostrovsky, Schwarz
6 Auctions for structured procurement - Cary, Flaxman, et al. - 2008
4 Optimal auction design and equilibrium selection in sponsored search auctions - EDELMAN, SCHWARZ
3 A short proof of the bulow-klemperer auctions vs. negotiations result. Economic Theory - Kirkegaard - 2006
2 Asymptotically optimal repeated auctions for sponsored search - Lambert, Shoham - 2007
2 KOZEN: The Design and Analysis of Algorithms - DEXTER - 1991
2 MILGROM: Putting Auction Theory to Work - PAUL - 2004
1 VOHRA: Ascending auctions for integral (poly)matroids with concave nondecreasing separable values - BIKHCHANDANI, VRIES, et al. - 2008
1 Simple versus optimal auctions - Hartline, Roughgarden
1 Lectures on frugal mechanism design. EECS 510 Lecture Notes. http: //users.eecs.northwestern.edu/~hartline/frugality.ps - HARTLINE - 2008
1 Auctions for structured procurement - CARY, FLAXMAN, et al. - 2008
1 Lectures on frugal mechanism design - Hartline - 2009
1 Asymptotically optimal repeatedauctions forsponsoredsearch - Shoham - 2007
1 Theintractability of computing the minimumdistance of a code - Vardy - 1997
1 AND PAUL KLEMPERER: Auctions versus negotiations - BULOW - 1996
1 AND JAN VONDRÁK: Maximizing non-monotone submodular functions - FEIGE, MIRROKNI
1 Approximation in Economic Design. 2011. Book in preparation. http: //www.eecs.northwestern.edu/hartline - HARTLINE
1 AND TIM ROUGHGARDEN: Simple versus optimal mechanisms - HARTLINE - 2009
1 AND TAMI TAMIR: Beyond VCG: Frugality of truthful mechanisms - KARLIN, KEMPE - 2005
1 AND YOAV SHOHAM: Asymptotically optimal repeated auctions for sponsored search - LAMBERT - 2007
1 MYERSON: Optimal auction design - ROGER - 1981
1 AND KEVIN LEYTON-BROWN: Revenue monotonicity in combinatorial auctions. SIGecom Exchanges - RASTEGARI, CONDON
1 TALWAR: The price of truth: Frugality in truthful mechanisms - KUNAL - 2003
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University