IDEAS home Printed from https://ideas.repec.org/r/eee/jetheo/v92y2000i1p66-95.html
   My bibliography  Save this item

The English Auction with Differentiated Commodities

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. 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.
  2. Josheski Dushko & Karamazova Elena, 2021. "Auction theory and a note on game mechanisms," Croatian Review of Economic, Business and Social Statistics, Sciendo, vol. 7(1), pages 43-59, May.
  3. Lawrence M. Ausubel & Peter Cramton & Paul Milgrom, 2012. "System and Method for a Hybrid Clock and Proxy Auction," Papers of Peter Cramton 10acmhc, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
  4. Le, Phuong, 2018. "Pareto optimal budgeted combinatorial auctions," Theoretical Economics, Econometric Society, vol. 13(2), May.
  5. Zhou, Yu & Serizawa, Shigehiro, 2023. "Multi-object auction design beyond quasi-linearity: Leading examples," Games and Economic Behavior, Elsevier, vol. 140(C), pages 210-228.
  6. Talman, Dolf & Yang, Zaifu, 2011. "A model of partnership formation," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 206-212, March.
  7. Babaioff, Moshe & Nisan, Noam & Pavlov, Elan, 2009. "Mechanisms for a spatially distributed market," Games and Economic Behavior, Elsevier, vol. 66(2), pages 660-684, July.
  8. Fabrizio Barca, 2008. "An Agenda for a Reformed Cohesion Policy A place-based approach to meeting European Union challenges and expectations," EERI Research Paper Series EERI_RP_2008_06, Economics and Econometrics Research Institute (EERI), Brussels.
  9. Holzman, Ron & Kfir-Dahav, Noa & Monderer, Dov & Tennenholtz, Moshe, 2004. "Bundling equilibrium in combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 47(1), pages 104-123, April.
  10. Ma, Jinpeng & Nie, Fusheng, 2003. "Walrasian equilibrium in an exchange economy with indivisibilities," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 159-192, October.
  11. 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.
  12. Andersson, Tommy & Yang, Zaifu & Zhang, Dongmo, 2015. "How to efficiently allocate houses under price controls?," Economics Letters, Elsevier, vol. 130(C), pages 97-99.
  13. Elizabeth Baldwin & Paul W. Goldberg & Paul Klemperer & Edwin Lock, 2019. "Solving Strong-Substitutes Product-Mix Auctions," Economics Papers 2019-W08, Economics Group, Nuffield College, University of Oxford.
  14. G. Koshevoy & S. Tijs & S. Miquel, 2006. "Equilibria for Pooling Situations," International Journal of Game Theory, Springer;Game Theory Society, vol. 34(1), pages 123-130, April.
  15. Jeremy Bulow & Jonathan Levin & Paul Milgrom, 2009. "Winning Play in Spectrum Auctions," NBER Working Papers 14765, National Bureau of Economic Research, Inc.
  16. 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.
  17. Yokote, Koji, 2021. "Consistency of the doctor-optimal equilibrium price vector in job-matching markets," Journal of Economic Theory, Elsevier, vol. 197(C).
  18. Laurent Lamy, 2009. "Ascending auctions: some impossibility results and their resolutions with final price discounts," PSE Working Papers halshs-00575076, HAL.
  19. Gerard van der Laan & Zaifu Yang, 2016. "An ascending multi-item auction with financially constrained bidders," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 109-149, December.
  20. Jim Ingebretsen Carlson, 2020. "A speedy auction using approximated bidders’ preferences," Annals of Operations Research, Springer, vol. 288(1), pages 65-93, May.
  21. Albin Erlanson, 2014. "The Duo-Item Bisection Auction," Computational Economics, Springer;Society for Computational Economics, vol. 43(1), pages 15-31, January.
  22. de Vries, Sven & Schummer, James & Vohra, Rakesh V., 2007. "On ascending Vickrey auctions for heterogeneous objects," Journal of Economic Theory, Elsevier, vol. 132(1), pages 95-118, January.
  23. 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.
  24. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions II: Ascending Auctions," Discussion Paper Series dp382, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  25. Mishra, Debasis & Talman, Dolf, 2010. "Characterization of the Walrasian equilibria of the assignment model," Journal of Mathematical Economics, Elsevier, vol. 46(1), pages 6-20, January.
  26. 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.
  27. Echenique, Federico, 2007. "Counting combinatorial choice rules," Games and Economic Behavior, Elsevier, vol. 58(2), pages 231-245, February.
  28. Andersson, T.D. & Andersson, C. & Talman, A.J.J., 2010. "Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders," Other publications TiSEM c7482a22-cb73-428b-9cc0-e, Tilburg University, School of Economics and Management.
  29. Lamy, Laurent, 2012. "On minimal ascending auctions with payment discounts," Games and Economic Behavior, Elsevier, vol. 75(2), pages 990-999.
  30. Hatfield, John William & Immorlica, Nicole & Kominers, Scott Duke, 2012. "Testing substitutability," Games and Economic Behavior, Elsevier, vol. 75(2), pages 639-645.
  31. Sotomayor, Marilda, 2007. "Connecting the cooperative and competitive structures of the multiple-partners assignment game," Journal of Economic Theory, Elsevier, vol. 134(1), pages 155-174, May.
  32. Tommy Andersson & Christer Andersson, 2012. "Properties of the DGS-Auction Algorithm," Computational Economics, Springer;Society for Computational Economics, vol. 39(2), pages 113-133, February.
  33. Xiaojing Xu & Jinpeng Ma & Xiaoping Xie, 2019. "Price Convergence under a Probabilistic Double Auction," Computational Economics, Springer;Society for Computational Economics, vol. 54(3), pages 1113-1155, October.
  34. De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
  35. Zheng, Charles Z., 2012. "Jump bidding and overconcentration in decentralized simultaneous ascending auctions," Games and Economic Behavior, Elsevier, vol. 76(2), pages 648-664.
  36. Marilda Sotomayor, 2008. "Adjusting Prices in the Many-to-many Assignment Game," Working Papers 2008-13, Brown University, Department of Economics.
  37. Yang, Yi-You, 2015. "On the Maximal Domain Theorem," MPRA Paper 67265, University Library of Munich, Germany.
  38. Rachel E. Kranton & Deborah F. Minehart, 2001. "A Theory of Buyer-Seller Networks," American Economic Review, American Economic Association, vol. 91(3), pages 485-508, June.
  39. Mingrong Wang & Mingxi Wang & Lihua Lang, 2017. "Reconsidering Carbon Permits Auction Mechanism: An Efficient Dynamic Model," The World Economy, Wiley Blackwell, vol. 40(8), pages 1624-1645, August.
  40. Jagadeesan, Ravi & Kominers, Scott Duke & Rheingans-Yoo, Ross, 2018. "Strategy-proofness of worker-optimal matching with continuously transferable utility," Games and Economic Behavior, Elsevier, vol. 108(C), pages 287-294.
  41. Bo Chen & Satoru Fujishige & Zaifu Yang, 2010. "Decentralized Market Processes to Stable Job Matchings with Competitive Salaries," KIER Working Papers 749, Kyoto University, Institute of Economic Research.
  42. Tayfun Sönmez & M. Utku Ünver, 2010. "Course Bidding At Business Schools," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 51(1), pages 99-123, February.
  43. 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.
  44. James Schummer & Rakesh V. Vohra, 2003. "Auctions for Procuring Options," Operations Research, INFORMS, vol. 51(1), pages 41-51, February.
  45. Ozan Candogan & Saša Pekeč, 2018. "Efficient Allocation and Pricing of Multifeatured Items," Management Science, INFORMS, vol. 64(12), pages 5521-5543, December.
  46. Paul Milgrom, 2009. "Assignment Messages and Exchanges," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 95-113, August.
  47. Milgrom, Paul & Strulovici, Bruno, 2009. "Substitute goods, auctions, and equilibrium," Journal of Economic Theory, Elsevier, vol. 144(1), pages 212-247, January.
  48. M. Yenmez, 2015. "Incentive compatible market design with applications," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 543-569, August.
  49. Hakan İnal, 2017. "An Extension of Ausubel's Auction for Heterogeneous Discrete Goods," Metroeconomica, Wiley Blackwell, vol. 68(4), pages 660-698, November.
  50. Yokote, Koji, 2017. "Application of the discrete separation theorem to auctions," MPRA Paper 82884, University Library of Munich, Germany.
  51. Ning Sun & Zaifu Yang, 2016. "A Theory of Marriage with Mutually Consented Divorces," Discussion Papers 16/14, Department of Economics, University of York.
  52. Paul Milgrom & Bruno Strulovici, 2006. "Substitutes Valuations with Divisible Goods," Levine's Bibliography 321307000000000126, UCLA Department of Economics.
  53. Nisan, Noam, 2015. "Algorithmic Mechanism Design," Handbook of Game Theory with Economic Applications,, Elsevier.
  54. Andersson, Tommy & Svensson, Lars-Gunnar, 2018. "Sequential rules for house allocation with price restrictions," Games and Economic Behavior, Elsevier, vol. 107(C), pages 41-59.
  55. Martin Bichler & Pasha Shabalin & Jürgen Wolf, 2013. "Do core-selecting Combinatorial Clock Auctions always lead to high efficiency? An experimental analysis of spectrum auction designs," Experimental Economics, Springer;Economic Science Association, vol. 16(4), pages 511-545, December.
  56. 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.
  57. Damian R. Beil & Lawrence M. Wein, 2009. "A Pooling Analysis of Two Simultaneous Online Auctions," Manufacturing & Service Operations Management, INFORMS, vol. 11(1), pages 33-51, October.
  58. Katerina Sherstyuk, 2002. "Simultaneous Ascending Auctions With Common Complementarities," Working Papers 200212, University of Hawaii at Manoa, Department of Economics.
  59. Nisan, Noam & Segal, Ilya, 2006. "The communication requirements of efficient allocations and supporting prices," Journal of Economic Theory, Elsevier, vol. 129(1), pages 192-224, July.
  60. Sotomayor, Marilda, 2005. "A Dynamic Market Clearing Price Mechanism with Multiple Demands," Brazilian Review of Econometrics, Sociedade Brasileira de Econometria - SBE, vol. 25(2), November.
  61. T. Andersson & C. Andersson & A. Talman, 2013. "Sets in excess demand in simple ascending auctions with unit-demand bidders," Annals of Operations Research, Springer, vol. 211(1), pages 27-36, December.
  62. Jinpeng Ma & Qiongling Li, 2016. "Convergence of price processes under two dynamic double auctions," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 1-44, December.
  63. Ning Sun & Zaifu Yang, 2008. "A Double-Track Auction for Substitutes and Complements," KIER Working Papers 656, Kyoto University, Institute of Economic Research.
  64. Le, Phuong, 2014. "Modified VCG Mechanisms in Combinatorial Auctions with Budget Constraints," MPRA Paper 66384, University Library of Munich, Germany.
  65. Zaifu Yang, 2008. "On the Solutions of Discrete Nonlinear Complementarity and Related Problems," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 976-990, November.
  66. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions I: Demand Queries," Discussion Paper Series dp381, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  67. Peters, Michael & Severinov, Sergei, 2006. "Internet auctions with many traders," Journal of Economic Theory, Elsevier, vol. 130(1), pages 220-245, September.
  68. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
  69. Paul Milgrom & Bruno Strulovici, 2006. "Concepts and Properties of Substitute Goods," Economics Papers 2006-W02, Economics Group, Nuffield College, University of Oxford.
  70. Aron Matskin & Daniel Lehmann, 2009. "General Matching: Lattice Structure of the Set of Agreements," Discussion Paper Series dp501, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  71. Rachel E. Kranton & Deborah F. Minehart, 2002. "Vertical Foreclosure and Specific Investments," Economics Working Papers 0013, Institute for Advanced Study, School of Social Science.
  72. Baranov, Oleg, 2018. "An efficient ascending auction for private valuations," Journal of Economic Theory, Elsevier, vol. 177(C), pages 495-517.
  73. Lehmann, Benny & Lehmann, Daniel & Nisan, Noam, 2006. "Combinatorial auctions with decreasing marginal utilities," Games and Economic Behavior, Elsevier, vol. 55(2), pages 270-296, May.
  74. Martin Bichler & Pasha Shabalin & Georg Ziegler, 2013. "Efficiency with Linear Prices? A Game-Theoretical and Computational Analysis of the Combinatorial Clock Auction," Information Systems Research, INFORMS, vol. 24(2), pages 394-417, June.
  75. David Pérez-Castrillo & Marilda Sotomayor, 2017. "On the manipulability of competitive equilibrium rules in many-to-many buyer–seller markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(4), pages 1137-1161, November.
  76. Mishra, Debasis & Parkes, David C., 2009. "Multi-item Vickrey-Dutch auctions," Games and Economic Behavior, Elsevier, vol. 66(1), pages 326-347, May.
  77. Sherstyuk, Katerina, 2003. "On competitive equilibria with common complementarities," Mathematical Social Sciences, Elsevier, vol. 46(1), pages 55-62, August.
  78. Lavi, Ron & Oren, Sigal, 2012. "Side-communication yields efficiency of ascending auctions: The two-items case," Games and Economic Behavior, Elsevier, vol. 76(2), pages 439-456.
  79. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
  80. Andreas A. Haupt & Nicole Immorlica & Brendan Lucier, 2023. "Certification Design for a Competitive Market," Papers 2301.13449, arXiv.org.
  81. Lawrence M. Ausubel & Peter Cramton & Wynne P. Jones, 2012. "System and Method for an Auction of Multiple Types of Items," Papers of Peter Cramton 11acjam, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
  82. Paul Milgrom & Bruno Strulovici, 2006. "Substitute Valuations, Auctions and Equilibrium with Discrete Goods," Levine's Bibliography 321307000000000713, UCLA Department of Economics.
  83. Satoru Fujishige & Zaifu Yang, 2017. "On a spontaneous decentralized market process," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 1-37, December.
  84. Tayfun Sönmez, 2013. "Bidding for Army Career Specialties: Improving the ROTC Branching Mechanism," Journal of Political Economy, University of Chicago Press, vol. 121(1), pages 186-219.
  85. Hitoshi Matsushima, 2010. "Auctioneer's Discretion in Combinatorial Auctions," CARF F-Series CARF-F-293, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo, revised Sep 2012.
  86. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
  87. Paes Leme, Renato, 2017. "Gross substitutability: An algorithmic survey," Games and Economic Behavior, Elsevier, vol. 106(C), pages 294-316.
  88. Oren Ben-Zwi & Ilan Newman, 2023. "No Ascending Auction can find Equilibrium for SubModular valuations," Papers 2312.00522, arXiv.org.
  89. Ozan Candogan & Markos Epitropou & Rakesh V. Vohra, 2021. "Competitive Equilibrium and Trading Networks: A Network Flow Approach," Operations Research, INFORMS, vol. 69(1), pages 114-147, January.
  90. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
  91. Ravi Jagadeesan & Scott Duke Kominers & Ross Rheingans-Yoo, 2020. "Lone wolves in competitive equilibria," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 55(2), pages 215-228, August.
  92. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
  93. Lars-Gunnar Svensson, 2009. "Coalitional strategy-proofness and fairness," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 40(2), pages 227-245, August.
  94. Arribas, Ivan & Urbano, Amparo, 2005. "Nash equilibria in a model of multiproduct price competition: an assignment problem," Journal of Mathematical Economics, Elsevier, vol. 41(3), pages 351-385, April.
  95. Huang, Chao, 2018. "Independence systems in gross-substitute valuations," Economics Letters, Elsevier, vol. 173(C), pages 135-137.
  96. Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.
  97. Taylor, Greg, 2012. "Defensive sniping and efficiency in simultaneous hard-close proxy auctions," Journal of Mathematical Economics, Elsevier, vol. 48(1), pages 51-58.
  98. Lavi, Ron & Nisan, Noam, 2015. "Online ascending auctions for gradually expiring items," Journal of Economic Theory, Elsevier, vol. 156(C), pages 45-76.
  99. Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
  100. Jorge Barrera & Alfredo Garcia, 2015. "Auction Design for the Efficient Allocation of Service Capacity Under Congestion," Operations Research, INFORMS, vol. 63(1), pages 151-165, February.
  101. Tomoya Tajika & Tomoya Kazumura, 2019. "Non-manipulability of uniform price auctions with a large number of objects," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(2), pages 543-569, June.
  102. Satoru Fujishige & Zaifu Yang, 2020. "A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities," Discussion Papers 20/08, Department of Economics, University of York.
  103. Marilda Sotomayor, 2009. "Adjusting prices in the multiple-partners assignment game," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(4), pages 575-600, November.
  104. Yan, Haomin, 2021. "Position auctions with multi-unit demands," Games and Economic Behavior, Elsevier, vol. 127(C), pages 179-193.
  105. Satoru Fujishige & Zaifu Yang, 2003. "A Note on Kelso and Crawford's Gross Substitutes Condition," Mathematics of Operations Research, INFORMS, vol. 28(3), pages 463-469, August.
  106. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.