IDEAS home Printed from https://ideas.repec.org/r/eee/jetheo/v129y2006i1p192-224.html

The communication requirements of efficient allocations and supporting prices

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. , & ,, 2012. "Mechanism design and communication networks," Theoretical Economics, Econometric Society, vol. 7(3), September.
  3. Anna Bogomolnaia & Hervé Moulin, 2025. "Fair division with money and prices: bid & sell versus divide & choose," Theory and Decision, Springer, vol. 99(1), pages 407-443, September.
  4. Hitoshi Matsushima, 2011. "Price-Based Combinatorial Auction: Connectedness and Representative Valuations," CARF F-Series CARF-F-261, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
  5. Paul Duetting & Michal Feldman & Inbal Talgam-Cohen, 2024. "Algorithmic Contract Theory: A Survey," Papers 2412.16384, arXiv.org.
  6. 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.
  7. Ran Canetti & Amos Fiat & Yannai A. Gonczarowski, 2023. "Zero-Knowledge Mechanisms," Papers 2302.05590, arXiv.org, revised Jul 2025.
  8. Goossens, D.R. & Müller, R.J. & Spieksma, F.C.R., 2007. "Matrix bids in combinatorial auctions: expressiveness and micro-economic properties," Research Memorandum 016, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  9. Elting, Steffen & Ehmke, Jan Fabian & Gansterer, Margaretha, 2025. "Preference learning for efficient bundle selection in horizontal transport collaborations," European Journal of Operational Research, Elsevier, vol. 324(3), pages 953-968.
  10. Dobzinski, Shahar & Nisan, Noam, 2015. "Multi-unit auctions: Beyond Roberts," Journal of Economic Theory, Elsevier, vol. 156(C), pages 14-44.
  11. Beardon, Alan F. & Rowat, Colin, 2013. "Efficient sets are small," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 367-374.
  12. Ryuji Sano, 2016. "Iterative Revelation Mechanisms," KIER Working Papers 937, Kyoto University, Institute of Economic Research.
  13. Kristóf Madarász & Andrea Prat, 2017. "Sellers with Misspecified Models," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 84(2), pages 790-815.
  14. Bergheimer, Stefan & Cantillon, Estelle & Reguant, Mar, 2023. "Price and quantity discovery without commitment," International Journal of Industrial Organization, Elsevier, vol. 90(C).
  15. Mu'alem, Ahuva, 2014. "Fair by design: Multidimensional envy-free mechanisms," Games and Economic Behavior, Elsevier, vol. 88(C), pages 29-46.
  16. Tim Roughgarden, 2018. "Complexity Theory, Game Theory, and Economics: The Barbados Lectures," Papers 1801.00734, arXiv.org, revised Feb 2020.
  17. Prat, Andrea & Madarász, Kristóf, 2010. "Screening with an Approximate Type Space," CEPR Discussion Papers 7900, Centre for Economic Policy Research.
  18. Shahar Dobzinski & Noam Nisan & Michael Schapira, 2010. "Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 1-13, February.
  19. Sébastien Lahaie & Benjamin Lubin, 2025. "Adaptive Pricing in Combinatorial Auctions," Management Science, INFORMS, vol. 71(10), pages 8967-8993, October.
  20. Grigorieva, Elena & Jean-Jacques Herings, P. & Müller, Rudolf & Vermeulen, Dries, 2012. "Fraction auctions: The tradeoff between efficiency and running time," European Journal of Operational Research, Elsevier, vol. 220(2), pages 577-587.
  21. Ozan Candogan & Saša Pekeč, 2018. "Efficient Allocation and Pricing of Multifeatured Items," Management Science, INFORMS, vol. 64(12), pages 5521-5543, December.
  22. Paul Milgrom, 2009. "Assignment Messages and Exchanges," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 95-113, August.
  23. Dobzinski, Shahar & Nisan, Noam & Oren, Sigal, 2019. "Economic efficiency requires interaction," Games and Economic Behavior, Elsevier, vol. 118(C), pages 589-608.
  24. Yiqing Xing & Anqi Li, 2014. "Simple Labor Income Tax Systems with Endogenous Employment Contracts," 2014 Meeting Papers 866, Society for Economic Dynamics.
  25. Saurabh Amin & Patrick Jaillet & Haripriya Pulyassary & Manxi Wu, 2023. "Market Design for Capacity Sharing in Networks," Papers 2307.03994, arXiv.org, revised Nov 2025.
  26. Cole, Richard & Tao, Yixin, 2021. "On the existence of Pareto Efficient and envy-free allocations," Journal of Economic Theory, Elsevier, vol. 193(C).
  27. Mu'alem, Ahuva & Nisan, Noam, 2008. "Truthful approximation mechanisms for restricted combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 64(2), pages 612-631, November.
  28. Nisan, Noam, 2015. "Algorithmic Mechanism Design," Handbook of Game Theory with Economic Applications,, Elsevier.
  29. Perennes, Patricia, 2014. "Use of combinatorial auctions in the railway industry: Can the “invisible hand” draw the railway timetable?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 67(C), pages 175-187.
  30. 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.
  31. Mu'alem, Ahuva & Schapira, Michael, 2018. "Setting lower bounds on truthfulness," Games and Economic Behavior, Elsevier, vol. 110(C), pages 174-193.
  32. Aviad Rubinstein & Raghuvansh R. Saxena & Clayton Thomas & S. Mathew Weinberg & Junyao Zhao, 2020. "Exponential Communication Separations between Notions of Selfishness," Papers 2012.14898, arXiv.org, revised Jun 2021.
  33. Ioannis Petrakis & Georg Ziegler & Martin Bichler, 2013. "Ascending Combinatorial Auctions with Allocation Constraints: On Game Theoretical and Computational Properties of Generic Pricing Rules," Information Systems Research, INFORMS, vol. 24(3), pages 768-786, September.
  34. 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.
  35. Alon Eden & Michal Feldman & Ophir Friedler & Inbal Talgam-Cohen & S. Matthew Weinberg, 2021. "A Simple and Approximately Optimal Mechanism for a Buyer with Complements," Operations Research, INFORMS, vol. 69(1), pages 188-206, January.
  36. Baranov, Oleg, 2018. "An efficient ascending auction for private valuations," Journal of Economic Theory, Elsevier, vol. 177(C), pages 495-517.
  37. 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.
  38. Blume, Lawrence & Easley, David & Kleinberg, Jon & Kleinberg, Robert & Tardos, Éva, 2015. "Introduction to computer science and economic theory," Journal of Economic Theory, Elsevier, vol. 156(C), pages 1-13.
  39. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
  40. Timothy Van Zandt, 2008. "The Interplay Between Incentives and Communication Complexity in Mechanism Design," 2008 Meeting Papers 480, Society for Economic Dynamics.
  41. Dries R. Goossens & Rudolf Müller & Frits C. R. Spieksma, 2010. "Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 339-352, August.
  42. Richard Li-Yang Chen & Shervin AhmadBeygi & Amy Cohn & Damian R. Beil & Amitabh Sinha, 2009. "Solving Truckload Procurement Auctions Over an Exponential Number of Bundles," Transportation Science, INFORMS, vol. 43(4), pages 493-510, November.
  43. Martin Bichler & Zhen Hao & Gediminas Adomavicius, 2017. "Coalition-Based Pricing in Ascending Combinatorial Auctions," Information Systems Research, INFORMS, vol. 28(1), pages 159-179, March.
  44. Babaioff, Moshe & Dobzinski, Shahar & Oren, Sigal, 2022. "Combinatorial auctions with endowment effect," Games and Economic Behavior, Elsevier, vol. 136(C), pages 255-273.
  45. Martin Bichler & Paul Milgrom & Gregor Schwarz, 2023. "Taming the Communication and Computation Complexity of Combinatorial Auctions: The FUEL Bid Language," Management Science, INFORMS, vol. 69(4), pages 2217-2238, April.
  46. 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.
  47. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
  48. Tierney, Ryan, 2021. "Simple Social Choice Rules for Exchange," Discussion Papers on Economics 4/2021, University of Southern Denmark, Department of Economics.
  49. Shahar Dobzinski & Noam Nisan & Michael Schapira, 2005. "Truthful Randomized Mechanisms for Combinatorial Auctions," Discussion Paper Series dp408, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  50. Paes Leme, Renato, 2017. "Gross substitutability: An algorithmic survey," Games and Economic Behavior, Elsevier, vol. 106(C), pages 294-316.
  51. Fadaei, Salman & Bichler, Martin, 2017. "Truthfulness with value-maximizing bidders: On the limits of approximation in combinatorial markets," European Journal of Operational Research, Elsevier, vol. 260(2), pages 767-777.
  52. Mishra, Debasis & Parkes, David C., 2009. "Multi-item Vickrey-Dutch auctions," Games and Economic Behavior, Elsevier, vol. 66(1), pages 326-347, May.
  53. Segal, Ilya, 2007. "The communication requirements of social choice rules and supporting budget sets," Journal of Economic Theory, Elsevier, vol. 136(1), pages 341-378, September.
  54. Babaioff, Moshe & Blumrosen, Liad & Schapira, Michael, 2013. "The communication burden of payment determination," Games and Economic Behavior, Elsevier, vol. 77(1), pages 153-167.
  55. John H. Kagel & Yuanchuan Lien & Paul Milgrom, 2010. "Ascending Prices and Package Bidding: A Theoretical and Experimental Analysis," American Economic Journal: Microeconomics, American Economic Association, vol. 2(3), pages 160-185, August.
  56. Fadel, Ronald & Segal, Ilya, 2009. "The communication cost of selfishness," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1895-1920, September.
  57. Ilya Segal, 2004. "The Communication Requirements of of Social Choice Rules and Supporting Budget Sets," Economics Working Papers 0039, Institute for Advanced Study, School of Social Science.
  58. Eiichiro Kazumori, 2010. "Core-Selecting Auctions: An Experimental Study," CARF F-Series CARF-F-226, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
  59. Mehmet Barlo & Nuh Aygün Dalkıran, 2022. "Computational implementation," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 605-633, December.
  60. Daniel Lehmann, 2019. "Revealed Preferences for Matching with Contracts," Papers 1908.08823, arXiv.org, revised Mar 2020.
  61. 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.