IDEAS home Printed from https://ideas.repec.org/r/sip/dpaper/08-014.html
   My bibliography  Save this item

Assignment Messages and Exchanges

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. 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.
  3. Daniel Jaume & Jordi Massó & Alejandro Neme, 2012. "The multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(2), pages 161-187, October.
  4. Can Kizilkale & Rakesh Vohra, 2020. "Constrained Trading Networks," Papers 2008.09757, arXiv.org.
  5. Martínez, Ruth & Massó, Jordi & Neme, Alejandro & Oviedo, Jorge, 2012. "On the invariance of the set of Core matchings with respect to preference profiles," Games and Economic Behavior, Elsevier, vol. 74(2), pages 588-600.
  6. Milgrom, Paul, 2010. "Simplified mechanisms with an application to sponsored-search auctions," Games and Economic Behavior, Elsevier, vol. 70(1), pages 62-70, September.
  7. Hafalir, Isa E. & Kojima, Fuhito & Yenmez, M. Bumin, 2022. "Interdistrict school choice: A theory of student assignment," Journal of Economic Theory, Elsevier, vol. 201(C).
  8. Goto, Masahiro & Kojima, Fuhito & Kurata, Ryoji & Tamura, Akihisa & Yokoo, Makoto, 2015. "Designing Matching Mechanisms under General Distributional Constraints," MPRA Paper 64000, University Library of Munich, Germany.
  9. Manjunath, Vikram & Westkamp, Alexander, 2021. "Strategy-proof exchange under trichotomous preferences," Journal of Economic Theory, Elsevier, vol. 193(C).
  10. Matías Núñez & Jean Laslier, 2014. "Preference intensity representation: strategic overstating in large elections," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(2), pages 313-340, February.
  11. McLaughlin, Kevin & Friedman, Daniel, 2016. "Online ad auctions: An experiment," Discussion Papers, Research Professorship Market Design: Theory and Pragmatics SP II 2016-501, WZB Berlin Social Science Center.
  12. Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
  13. Kojima, Fuhito & Tamura, Akihisa & Yokoo, Makoto, 2018. "Designing matching mechanisms under constraints: An approach from discrete convex analysis," Journal of Economic Theory, Elsevier, vol. 176(C), pages 803-833.
  14. Massó, Jordi & Neme, Alejandro, 2014. "On cooperative solutions of a generalized assignment game: Limit theorems to the set of competitive equilibria," Journal of Economic Theory, Elsevier, vol. 154(C), pages 187-215.
  15. Hatfield, John William & Immorlica, Nicole & Kominers, Scott Duke, 2012. "Testing substitutability," Games and Economic Behavior, Elsevier, vol. 75(2), pages 639-645.
  16. Ahmet Alkan & Alparslan Tuncay, 2014. "Pairing Games and Markets," Working Papers 2014.48, Fondazione Eni Enrico Mattei.
  17. Jacob K. Goeree & Luke Lindsay, 2012. "Designing package markets to eliminate exposure risk," ECON - Working Papers 071, Department of Economics - University of Zurich.
  18. Kamada, Yuichiro & Kojima, Fuhito, 2018. "Stability and strategy-proofness for matching with constraints: a necessary and sufficient condition," Theoretical Economics, Econometric Society, vol. 13(2), May.
  19. Fichtl, Maximilian, 2021. "On the expressiveness of assignment messages," Economics Letters, Elsevier, vol. 208(C).
  20. Nenad Kos, 2011. "Asking Questions," Working Papers 405, IGIER (Innocenzo Gasparini Institute for Economic Research), Bocconi University.
  21. Kos, Nenad, 2014. "Asking questions," Games and Economic Behavior, Elsevier, vol. 87(C), pages 642-650.
  22. Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 193-236, January.
  23. 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.
  24. Orhan Aygun & Bertan Turhan, 2020. "Designing Direct Matching Mechanism for India with Comprehensive Affirmative Action," Papers 2004.13264, arXiv.org, revised Dec 2021.
  25. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
  26. R. Pablo Arribillaga & Jordi Massó & Alejandro Neme, 2014. "On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game," Journal of Applied Mathematics, Hindawi, vol. 2014, pages 1-20, April.
  27. Edoardo Gaffeo & Ronny Mazzocchi, 2019. "“The price is right”: using auction theory to enhance competition in the NPL market," Journal of Banking Regulation, Palgrave Macmillan, vol. 20(1), pages 104-112, March.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.