IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login

Citations for "The communication requirements of efficient allocations and supporting prices"

by Nisan, Noam & Segal, Ilya

For a complete description of this item, click here. For a RSS feed for citations of this item, click here.
as in new window

  1. 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.
  2. 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.
  3. 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.
  4. Tomala, Tristan & Renou, Ludovic, 2010. "Mechanism design and communication networks," Les Cahiers de Recherche 926, HEC Paris.
  5. Nisan, Noam, 2015. "Algorithmic Mechanism Design," Handbook of Game Theory with Economic Applications, in: Handbook of Game Theory with Economic Applications, volume 4, chapter 9, pages 477-515 Elsevier.
  6. Babaioff, Moshe & Blumrosen, Liad & Schapira, Michael, 2013. "The communication burden of payment determination," Games and Economic Behavior, Elsevier, vol. 77(1), pages 153-167.
  7. Beardon, Alan F. & Rowat, Colin, 2013. "Efficient sets are small," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 367-374.
  8. Yiqing Xing & Anqi Li, 2014. "Simple Labor Income Tax Systems with Endogenous Employment Contracts," 2014 Meeting Papers 866, Society for Economic Dynamics.
  9. Fadel, Ronald & Segal, Ilya, 2009. "The communication cost of selfishness," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1895-1920, September.
  10. 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.
  11. 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.
  12. Mishra, Debasis & Parkes, David C., 2009. "Multi-item Vickrey-Dutch auctions," Games and Economic Behavior, Elsevier, vol. 66(1), pages 326-347, May.
  13. 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.
  14. Goossens D.R. & Müller R. & 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).
  15. Madarász, Kristóf & Prat, Andrea, 2010. "Screening with an Approximate Type Space," CEPR Discussion Papers 7900, C.E.P.R. Discussion Papers.
  16. 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.
  17. 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.
  18. 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.
  19. 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.
  20. 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, vol. 16(4), pages 511-545, December.
  21. Paul Milgrom, 2009. "Assignment Messages and Exchanges," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 95-113, August.
  22. 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.
  23. Timothy Van Zandt, 2008. "The Interplay Between Incentives and Communication Complexity in Mechanism Design," 2008 Meeting Papers 480, Society for Economic Dynamics.
  24. 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-85, August.
  25. Dobzinski, Shahar & Nisan, Noam, 2015. "Multi-unit auctions: Beyond Roberts," Journal of Economic Theory, Elsevier, vol. 156(C), pages 14-44.
  26. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.