Activity Rules for the Combinatorial Clock Auction
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Ausubel Lawrence M & Milgrom Paul R, 2002.
"Ascending Auctions with Package Bidding,"
The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-44, August.
- Lawrence M. Ausubel & Paul Milgrom, 2002. "Ascending Auctions with Package Bidding," Working Papers 02004, Stanford University, Department of Economics.
- Robert Day & Paul Milgrom, 2008. "Core-selecting package auctions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 393-407, March.
- Robert W. Day & S. Raghavan, 2007. "Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions," Management Science, INFORMS, vol. 53(9), pages 1389-1406, September.
- Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
- Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Peter Cramton, 2013.
"Spectrum Auction Design,"
Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
- Peter Cramton, 2009. "Spectrum Auction Design," Papers of Peter Cramton 09sad, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
- A. Talman & Zaifu Yang, 2015.
"An efficient multi-item dynamic auction with budget constrained bidders,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 769-784, August.
- Talman, A.J.J. & Yang, Z.F., 2011. "An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders," Discussion Paper 2011-096, Tilburg University, Center for Economic Research.
- Talman, A.J.J. & Yang, Z.F., 2011. "An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders," Other publications TiSEM 49292c72-515d-42f4-a0d4-c, Tilburg University, School of Economics and Management.
- Dolf Talman & Zaifu Yang, 2013. "An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders," Discussion Papers 13/31, Department of Economics, University of York.
- Shirata, Yasuhiro, 2017.
"First price package auction with many traders,"
Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 71-83.
- Shirata, Yasuhiro, 2013. "First Price Package Auction with Many Traders," ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation) 10252/5134, Otaru University of Commerce.
- Hitoshi Matsushima, 2011.
"Efficient Combinatorial Exchanges,"
CIRJE F-Series
CIRJE-F-826, CIRJE, Faculty of Economics, University of Tokyo.
- Hitoshi Matsushima, 2011. "Efficient Combinatorial Exchanges," CARF F-Series CARF-F-258, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
- Kaplan, Todd R. & Zamir, Shmuel, 2015.
"Advances in Auctions,"
Handbook of Game Theory with Economic Applications,,
Elsevier.
- Kaplan, Todd R & Zamir, Shmuel, 2014. "Advances in Auctions," MPRA Paper 54656, University Library of Munich, Germany.
- Todd R. Kaplan & Shmuel Zamir, 2014. "Advances in Auctions," Discussion Papers 1405, University of Exeter, Department of Economics.
- Todd R. Kaplan & Shmuel Zamir, 2014. "Advances in Auctions," Discussion Paper Series dp662, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
- Mishra, Debasis & Parkes, David C., 2007.
"Ascending price Vickrey auctions for general valuations,"
Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
- MISHRA, Debasis & PARKES, David C., 2005. "Ascending price Vickrey auctions for general valuations," LIDAM Discussion Papers CORE 2005052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Laurent Lamy, 2010.
"Core-selecting package auctions: a comment on revenue-monotonicity,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 503-510, July.
- Laurent Lamy, 2010. "Core-selecting package auctions: a comment on revenue-monotonicity," PSE-Ecole d'économie de Paris (Postprint) halshs-00754436, HAL.
- Laurent Lamy, 2010. "Core-selecting package auctions: a comment on revenue-monotonicity," Post-Print halshs-00754436, HAL.
- Ryuji Sano, 2021. "Dynamic communication mechanism design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(1), pages 163-180, July.
- Tomoya Kazumura & Shigehiro Serizawa, 2016.
"Efficiency and strategy-proofness in object assignment problems with multi-demand preferences,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 633-663, October.
- Tomoya Kazumura & Shigehiro Serizawa, 2015. "Efficiency and strategy-proofness in object assignment problems with multi demand preferences," ISER Discussion Paper 0943, Institute of Social and Economic Research, Osaka University.
- Ingebretsen Carlson, Jim, 2016. "An Auction with Approximated Bidder Preferences - When an Auction has to be Quick," Working Papers 2016:12, Lund University, Department of Economics.
- Paul Dütting & Vasilis Gkatzelis & Tim Roughgarden, 2017. "The Performance of Deferred-Acceptance Auctions," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 897-914, November.
- , K. & ,, 2016.
"On the impossibility of core-selecting auctions,"
Theoretical Economics, Econometric Society, vol. 11(1), January.
- Jacob K. Goeree & Yuanchuan Lien, 2009. "On the impossibility of core-selecting auctions," IEW - Working Papers 452, Institute for Empirical Research in Economics - University of Zurich.
- Andersson, Tommy & Erlanson, Albin, 2013.
"Multi-item Vickrey–English–Dutch auctions,"
Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
- Andersson, Tommy & Erlanson, Albin, 2012. "Multi-Item Vickery-English-Dutch Auctions," Working Papers 2012:17, Lund University, Department of Economics, revised 15 Jan 2013.
- Sushil Bikhchandani & Sven de Vries & James Schummer & Rakesh V. Vohra, 2011.
"An Ascending Vickrey Auction for Selling Bases of a Matroid,"
Operations Research, INFORMS, vol. 59(2), pages 400-413, April.
- Sushil Bikhchandani & Sven de Vries & James Schummer & Rakesh V. Vohra, 2005. "An Ascending Vickrey Auction for Selling Bases of a Matroid," Levine's Bibliography 784828000000000133, UCLA Department of Economics.
- De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
- Hashimoto, Tadashi, 2018. "The generalized random priority mechanism with budgets," Journal of Economic Theory, Elsevier, vol. 177(C), pages 708-733.
- Isa Hafalir & Hadi Yektaş, 2015.
"Core deviation minimizing auctions,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 44(2), pages 367-376, May.
- Isa Hafalir & Hadi Yektas, "undated". "Core Deviation Minimizing Auctions," GSIA Working Papers 2012-E23, Carnegie Mellon University, Tepper School of Business.
- Aytek Erdil & Paul Klemperer, 2010.
"A New Payment Rule for Core-Selecting Package Auctions,"
Journal of the European Economic Association, MIT Press, vol. 8(2-3), pages 537-547, 04-05.
- Aytek Erdil & Paul Klemperer, 2009. "A New Payment Rule for Core-Selecting Package Auctions," Economics Papers 2009-W11, Economics Group, Nuffield College, University of Oxford.
- Klemperer, Paul & Erdil, Aytek, 2009. "A New Payment Rule for Core-Selecting Package Auctions," CEPR Discussion Papers 7487, C.E.P.R. Discussion Papers.
- Paul Karaenke & Martin Bichler & Stefan Minner, 2019. "Coordination Is Hard: Electronic Auction Mechanisms for Increased Efficiency in Transportation Logistics," Management Science, INFORMS, vol. 65(12), pages 5884-5900, December.
More about this item
Keywords
Auctions; spectrum auctions; market design; package auction; clock auction; combinatorial auction;All these keywords.
JEL classification:
- D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
- L96 - Industrial Organization - - Industry Studies: Transportation and Utilities - - - Telecommunications
NEP fields
This paper has been announced in the following NEP Reports:- NEP-MIC-2012-10-13 (Microeconomics)
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pcc:pccumd:11acar. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Cramton (email available below). General contact details of provider: https://www.cramton.umd.edu .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.