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

A New Solution to the Random Assignment Problem

Citations

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


Cited by:

  1. Han, Xiang, 2016. "On the consistency of random serial dictatorship," Economics Letters, Elsevier, vol. 145(C), pages 168-171.
  2. Ran I. Shorrer & Sandor Sovago, 2017. "Obvious Mistakes in a Strategically Simple College Admissions Environment," Tinbergen Institute Discussion Papers 17-107/V, Tinbergen Institute.
  3. Eduardo M Azevedo & Eric Budish, 2019. "Strategy-proofness in the Large," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 86(1), pages 81-116.
  4. Ramezanian, Rasoul & Feizi, Mehdi, 2021. "Stepwise ordinal efficiency for the random assignment problem," Journal of Mathematical Economics, Elsevier, vol. 92(C), pages 60-65.
  5. Jérémy Picot, 2012. "Random aggregation without the Pareto principle," Review of Economic Design, Springer;Society for Economic Design, vol. 16(1), pages 1-13, March.
  6. Aziz, Haris & Luo, Pang & Rizkallah, Christine, 2017. "Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences," Economics Letters, Elsevier, vol. 160(C), pages 46-49.
  7. Ortega, Josué & Klein, Thilo, 2023. "The cost of strategy-proofness in school choice," Games and Economic Behavior, Elsevier, vol. 141(C), pages 515-528.
  8. Hugh-Jones, David & Kurino, Morimitsu & Vanberg, Christoph, 2014. "An experimental study on the incentives of the probabilistic serial mechanism," Games and Economic Behavior, Elsevier, vol. 87(C), pages 367-380.
  9. Hervé Crès & Hervé Moulin, 2001. "Scheduling with Opting Out: Improving upon Random Priority," Operations Research, INFORMS, vol. 49(4), pages 565-577, August.
  10. Laslier, Jean-François & Núñez, Matías & Remzi Sanver, M., 2021. "A solution to the two-person implementation problem," Journal of Economic Theory, Elsevier, vol. 194(C).
  11. Patrick Harless & William Phan, 2020. "On endowments and indivisibility: partial ownership in the Shapley–Scarf model," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 411-435, September.
  12. Liu, Peng, 2020. "Random assignments on sequentially dichotomous domains," Games and Economic Behavior, Elsevier, vol. 121(C), pages 565-584.
  13. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
  14. Felix Brandt & Patrick Lederer & René Romen, 2024. "Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(1), pages 19-55, August.
  15. Federico Echenique & Antonio Miralles & Jun Zhang, 2019. "Fairness and efficiency for probabilistic allocations with participation constraints," Papers 1908.04336, arXiv.org, revised May 2020.
  16. Freeman, Rupert & Pritchard, Geoffrey & Wilson, Mark, 2021. "Order Symmetry: A New Fairness Criterion for Assignment Mechanisms," SocArXiv xt37c, Center for Open Science.
  17. Liu, Peng, 2020. "Local vs. global strategy-proofness: A new equivalence result for ordinal mechanisms," Economics Letters, Elsevier, vol. 189(C).
  18. Aziz, Haris & Brandt, Felix & Brill, Markus, 2013. "The computational complexity of random serial dictatorship," Economics Letters, Elsevier, vol. 121(3), pages 341-345.
  19. Yoichi Kasajima, 2013. "Probabilistic assignment of indivisible goods with single-peaked preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(1), pages 203-215, June.
  20. Aziz, Haris & Brandl, Florian, 2022. "The vigilant eating rule: A general approach for probabilistic economic design with constraints," Games and Economic Behavior, Elsevier, vol. 135(C), pages 168-187.
  21. Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," American Economic Review, American Economic Association, vol. 102(5), pages 2237-2271, August.
  22. Korpela, Ville & Lombardi, Michele & Saulle, Riccardo D., 2024. "Designing rotation programs: Limits and possibilities," Games and Economic Behavior, Elsevier, vol. 143(C), pages 77-102.
  23. Yeon-Koo Che & Fuhito Kojima, 2010. "Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms," Econometrica, Econometric Society, vol. 78(5), pages 1625-1672, September.
  24. Daniel Kornbluth & Alexey Kushnir, 2024. "Undergraduate Course Allocation through Competitive Markets," Papers 2412.05691, arXiv.org.
  25. Schlegel, Jan Christoph & Mamageishvili, Akaki, 2020. "Welfare theorems for random assignments with priorities," Games and Economic Behavior, Elsevier, vol. 124(C), pages 62-81.
  26. Che, Yeon-Koo & Kim, Jinwoo & Kojima, Fuhito, 2015. "Efficient assignment with interdependent values," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 54-86.
  27. Bogomolnaia, Anna & Heo, Eun Jeong, 2012. "Probabilistic assignment of objects: Characterizing the serial rule," Journal of Economic Theory, Elsevier, vol. 147(5), pages 2072-2082.
  28. Aytek Erdil, 2013. "Strategy-Proof Stochastic Assignment," Cambridge Working Papers in Economics 1333, Faculty of Economics, University of Cambridge.
  29. YIlmaz, Özgür, 2009. "Random assignment under weak preferences," Games and Economic Behavior, Elsevier, vol. 66(1), pages 546-558, May.
  30. Haris Aziz, 2017. "Characterizing SW-Efficiency in the Social Choice Domain," Economics Bulletin, AccessEcon, vol. 37(1), pages 48-51.
  31. Aziz, Haris & Brandl, Florian & Brandt, Felix, 2015. "Universal Pareto dominance and welfare for plausible utility functions," Journal of Mathematical Economics, Elsevier, vol. 60(C), pages 123-133.
  32. Balbuzanov, Ivan, 2020. "Short trading cycles: Paired kidney exchange with strict ordinal preferences," Mathematical Social Sciences, Elsevier, vol. 104(C), pages 78-87.
  33. Liu, Peng & Zeng, Huaxia, 2019. "Random assignments on preference domains with a tier structure," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 176-194.
  34. Cho, Wonki Jo & Park, Chang Woo, 2018. "Fractional group identification," Journal of Mathematical Economics, Elsevier, vol. 77(C), pages 66-75.
  35. Lars Ehlers & Bettina Klaus, 2003. "Probabilistic assignments of identical indivisible objects and uniform probabilistic rules," Review of Economic Design, Springer;Society for Economic Design, vol. 8(3), pages 249-268, October.
  36. Brandt, Felix & Saile, Christian & Stricker, Christian, 2022. "Strategyproof social choice when preferences and outcomes may contain ties," Journal of Economic Theory, Elsevier, vol. 202(C).
  37. Chao Huang, 2021. "Stable matching: an integer programming approach," Papers 2103.03418, arXiv.org, revised Apr 2022.
  38. Erdil, Aytek, 2014. "Strategy-proof stochastic assignment," Journal of Economic Theory, Elsevier, vol. 151(C), pages 146-162.
  39. Ehlers, Lars & Majumdar, Dipjyoti & Mishra, Debasis & Sen, Arunava, 2020. "Continuity and incentive compatibility in cardinal mechanisms," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 31-41.
  40. Grenet, Julien & He, YingHua & Kübler, Dorothea, 2022. "Preference Discovery in University Admissions: The Case for Dynamic Multioffer Mechanisms," EconStor Open Access Articles and Book Chapters, ZBW - Leibniz Information Centre for Economics, vol. 130(6), pages 1-1.
  41. Feizi, Mehdi & Ramezanian, Rasoul, 2023. "A new impossibility result for random assignments," Journal of Mathematical Economics, Elsevier, vol. 107(C).
  42. Clayton Featherstone & Muriel Niederle, 2008. "Ex Ante Efficiency in School Choice Mechanisms: An Experimental Investigation," NBER Working Papers 14618, National Bureau of Economic Research, Inc.
  43. Pycia, Marek & Ünver, M. Utku, 2015. "Decomposing random mechanisms," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 21-33.
  44. Pu, Yun, 2020. "College admission in three Chinese provinces: Province-specific versus pooling quotas," China Economic Review, Elsevier, vol. 60(C).
  45. Basteck, Christian, 2024. "An axiomatization of the random priority rule," Discussion Papers, Research Unit: Market Behavior SP II 2024-201, WZB Berlin Social Science Center.
  46. Mihai Manea, 2008. "Random serial dictatorship and ordinally efficient contracts," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 489-496, March.
  47. Ramezanian, Rasoul & Feizi, Mehdi, 2022. "Robust ex-post Pareto efficiency and fairness in random assignments: Two impossibility results," Games and Economic Behavior, Elsevier, vol. 135(C), pages 356-367.
  48. Stergios Athanassoglou & Jay Sethuraman, 2011. "House allocation with fractional endowments," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(3), pages 481-513, August.
  49. Kushnir, Alexey, 2013. "Harmful signaling in matching markets," Games and Economic Behavior, Elsevier, vol. 80(C), pages 209-218.
  50. Thomson, William, 2011. "Chapter Twenty-One - Fair Allocation Rules," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 2, chapter 21, pages 393-506, Elsevier.
  51. Miralles, Antonio, 2012. "Cardinal Bayesian allocation mechanisms without transfers," Journal of Economic Theory, Elsevier, vol. 147(1), pages 179-206.
  52. YIlmaz, Özgür, 2010. "The probabilistic serial mechanism with private endowments," Games and Economic Behavior, Elsevier, vol. 69(2), pages 475-491, July.
  53. He, Yinghua & Li, Sanxi & Yan, Jianye, 2015. "Evaluating assignment without transfers: A market perspective," Economics Letters, Elsevier, vol. 133(C), pages 40-44.
  54. José Alcalde & Antonio Romero-Medina, 2017. "Fair student placement," Theory and Decision, Springer, vol. 83(2), pages 293-307, August.
  55. Aziz, Haris & Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2017. "Computational aspects of assigning agents to a line," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 93-99.
  56. Brandl, Florian & Brandt, Felix & Suksompong, Warut, 2016. "The impossibility of extending random dictatorship to weak preferences," Economics Letters, Elsevier, vol. 141(C), pages 44-47.
  57. Lars Ehlers & Bettina Klaus, 2003. "Resource-Monotonicity for House Allocation," Working Papers 33, Barcelona School of Economics.
  58. Akyol, Ethem, 2023. "Inefficiency of Random Serial Dictatorship under incomplete information," Journal of Economic Theory, Elsevier, vol. 213(C).
  59. Ortega, Josue & Klein, Thilo, 2022. "Improving efficiency and equality in school choice," ZEW Discussion Papers 22-046, ZEW - Leibniz Centre for European Economic Research.
  60. Echenique, Federico & Miralles, Antonio & Zhang, Jun, 2021. "Fairness and efficiency for allocations with participation constraints," Journal of Economic Theory, Elsevier, vol. 195(C).
  61. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
  62. David Dillenberger & Uzi Segal, 2024. "Allocation Mechanisms with Mixture-Averse Preferences," Boston College Working Papers in Economics 1065, Boston College Department of Economics.
  63. Ben-Shoham, Assaf & Serrano, Roberto & Volij, Oscar, 2004. "The evolution of exchange," Journal of Economic Theory, Elsevier, vol. 114(2), pages 310-328, February.
  64. Lars EHLERS & Dipjyoti MAJUMDAR & Debasis MISHRA & Arunava SEN, 2016. "Continuity and Incentive Compatibility in Cardinal Voting Mechanisms," Cahiers de recherche 04-2016, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
  65. Athanassoglou, Stergios, 2011. "Efficiency under a combination of ordinal and cardinal information on preferences," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 180-185, March.
  66. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
  67. Christopher P. Chambers & Michael Richter, 2023. "Ordinal allocation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 60(1), pages 5-14, January.
  68. Zhang, Jun, 2023. "Strategy-proof allocation with outside option," Games and Economic Behavior, Elsevier, vol. 137(C), pages 50-67.
  69. Phuong Le, 2017. "Competitive equilibrium in the random assignment problem," International Journal of Economic Theory, The International Society for Economic Theory, vol. 13(4), pages 369-385, December.
  70. Pereyra, Juan Sebastián & Silva, Francisco, 2023. "Optimal assignment mechanisms with imperfect verification," Theoretical Economics, Econometric Society, vol. 18(2), May.
  71. Aziz, Haris & Mestre, Julián, 2014. "Parametrized algorithms for random serial dictatorship," Mathematical Social Sciences, Elsevier, vol. 72(C), pages 1-6.
  72. Chen, Yiling & Lai, John K. & Parkes, David C. & Procaccia, Ariel D., 2013. "Truth, justice, and cake cutting," Games and Economic Behavior, Elsevier, vol. 77(1), pages 284-297.
  73. Zhang, Jun, 2020. "When are efficient and fair assignment mechanisms group strategy-proof?," Games and Economic Behavior, Elsevier, vol. 119(C), pages 251-266.
  74. Noda, Shunya, 2022. "Strategic experimentation with random serial dictatorship," Games and Economic Behavior, Elsevier, vol. 133(C), pages 115-125.
  75. Anastasia Danilov & Ju Yeong Hong & Anja Schöttner, 2024. "Strategic Use of Unfriendly Leadership and Labor Market Competition: An Experimental Analysis," Rationality and Competition Discussion Paper Series 507, CRC TRR 190 Rationality and Competition.
  76. Dasgupta, Sulagna, 2024. "Designing information to improve welfare in matching markets," Mathematical Social Sciences, Elsevier, vol. 131(C), pages 5-16.
  77. Chatterji, Shurojit & Roy, Souvik & Sen, Arunava, 2012. "The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences," Journal of Mathematical Economics, Elsevier, vol. 48(6), pages 353-366.
  78. Jugal Garg & Thorben Trobst & Vijay V. Vazirani, 2020. "One-Sided Matching Markets with Endowments: Equilibria and Algorithms," Papers 2009.10320, arXiv.org, revised Jul 2021.
  79. Jun Zhang, 2023. "On wastefulness of random assignments in discrete allocation problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(1), pages 289-310, July.
  80. Basteck, Christian & Ehlers, Lars, 2023. "Strategy-proof and envy-free random assignment," Journal of Economic Theory, Elsevier, vol. 209(C).
  81. Anna Bogomolnaia & Herve Moulin, 2004. "Random Matching Under Dichotomous Preferences," Econometrica, Econometric Society, vol. 72(1), pages 257-279, January.
  82. William Thomson, 2018. "On the terminology of economic design: a critical assessment and some proposals," Review of Economic Design, Springer;Society for Economic Design, vol. 22(1), pages 67-99, June.
  83. Ehlers, Lars & Klaus, Bettina, 2006. "Efficient priority rules," Games and Economic Behavior, Elsevier, vol. 55(2), pages 372-384, May.
  84. Jonathan Scarlett & Nicholas Teh & Yair Zick, 2023. "For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods," Papers 2302.06958, arXiv.org.
  85. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
  86. Lê Nguyên Hoang, 2017. "Strategy-proofness of the randomized Condorcet voting system," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(3), pages 679-701, March.
  87. Sophie Bade, 2020. "Random Serial Dictatorship: The One and Only," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 353-368, February.
  88. Ehlers, Lars & Klaus, Bettina & Papai, Szilvia, 2002. "Strategy-proofness and population-monotonicity for house allocation problems," Journal of Mathematical Economics, Elsevier, vol. 38(3), pages 329-339, November.
  89. Basteck, Christian, 2018. "Fair solutions to the random assignment problem," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 163-172.
  90. Atila Abdulkadiroglu & Tayfun Sönmez, 2003. "School Choice: A Mechanism Design Approach," American Economic Review, American Economic Association, vol. 93(3), pages 729-747, June.
  91. Haris Aziz & Florian Brandl, 2020. "The Vigilant Eating Rule: A General Approach for Probabilistic Economic Design with Constraints," Papers 2008.08991, arXiv.org, revised Jul 2021.
  92. Onur Kesten & Morimitsu Kurino & Alexander S. Nesterov, 2017. "Efficient lottery design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 31-57, January.
  93. Xu Lang & Zaifu Yang, 2021. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints," Discussion Papers 21/04, Department of Economics, University of York.
  94. Hashimoto, Tadashi, 2018. "The generalized random priority mechanism with budgets," Journal of Economic Theory, Elsevier, vol. 177(C), pages 708-733.
  95. Salvador Barberà, 2010. "Strategy-proof social choice," UFAE and IAE Working Papers 828.10, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
  96. Carroll, Gabriel, 2014. "A general equivalence theorem for allocation of indivisible objects," Journal of Mathematical Economics, Elsevier, vol. 51(C), pages 163-177.
  97. Rustamdjan Hakimov & C.-Philipp Heller & Dorothea Kübler & Morimitsu Kurino, 2021. "How to Avoid Black Markets for Appointments with Online Booking Systems," American Economic Review, American Economic Association, vol. 111(7), pages 2127-2151, July.
  98. Yinghua He & Antonio Miralles & Jianye Yan, 2012. "Competitive Equilibrium from Equal Incomes for Two-Sided Matching," Working Papers 692, Barcelona School of Economics.
  99. Ortega, Josué, 2020. "Multi-unit assignment under dichotomous preferences," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 15-24.
  100. Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
  101. Youngsub Chun & Kiyong Yun, 2020. "Upper-contour strategy-proofness in the probabilistic assignment problem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(4), pages 667-687, April.
  102. Thayer Morrill, 2013. "An alternative characterization of top trading cycles," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 54(1), pages 181-197, September.
  103. Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
  104. repec:cty:dpaper:10.1016/j.geb.2020.08.009 is not listed on IDEAS
  105. Piotr Dworczak & Scott Duke Kominers & Mohammad Akbarpour, 2021. "Redistribution Through Markets," Econometrica, Econometric Society, vol. 89(4), pages 1665-1698, July.
  106. Abdulkadiroglu, Atila & Sonmez, Tayfun, 2003. "Ordinal efficiency and dominated sets of assignments," Journal of Economic Theory, Elsevier, vol. 112(1), pages 157-172, September.
  107. Atila Abdulkadiro?lu & Yeon-Koo Che & Yosuke Yasuda, 2015. "Expanding "Choice" in School Choice," American Economic Journal: Microeconomics, American Economic Association, vol. 7(1), pages 1-42, February.
  108. Eraslan, H.Hulya & McLennan, Andrew, 2004. "Strategic candidacy for multivalued voting procedures," Journal of Economic Theory, Elsevier, vol. 117(1), pages 29-54, July.
  109. Lars Ehlers & Bettina Klaus, 2004. "Resource-monotonicity for house allocation problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 32(4), pages 545-560, August.
  110. Ekici, Özgün, 2013. "Reclaim-proof allocation of indivisible objects," Games and Economic Behavior, Elsevier, vol. 81(C), pages 1-10.
  111. Basteck, Christian & Ehlers, Lars H., 2022. "Strategy-proof and envy-free random assignment," Discussion Papers, Research Unit: Market Behavior SP II 2022-208, WZB Berlin Social Science Center.
  112. Doğan, Battal & Yıldız, Kemal, 2016. "Efficiency and stability of probabilistic assignments in marriage problems," Games and Economic Behavior, Elsevier, vol. 95(C), pages 47-58.
  113. Yasunori Okumura, 2024. "Strategic Analysis of Fair Rank-Minimizing Mechanisms with Agent Refusal Option," Papers 2408.01673, arXiv.org, revised Dec 2024.
  114. Hideo Konishi & Nicolas Sahuguet & Benoît S. Y. Crutzen, 2024. "Allocation rules of indivisible prizes in team contests," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 78(1), pages 69-100, August.
  115. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
  116. Grenet, Julien & He, Yinghua & Kübler, Dorothea, 2019. "Decentralizing centralized matching markets: Implications from early offers in university admissions," Discussion Papers, Research Unit: Market Behavior SP II 2019-208, WZB Berlin Social Science Center.
  117. Bogomolnaia, Anna, 2015. "Random assignment: Redefining the serial rule," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 308-318.
  118. Fragiadakis, Daniel E. & Troyan, Peter, 2019. "Designing mechanisms to focalize welfare-improving strategies," Games and Economic Behavior, Elsevier, vol. 114(C), pages 232-252.
  119. Can Zhang & Atalay Atasu & Turgay Ayer & L. Beril Toktay, 2020. "Truthful Mechanisms for Medical Surplus Product Allocation," Manufacturing & Service Operations Management, INFORMS, vol. 22(4), pages 735-753, July.
  120. Cho, Wonki Jo, 2016. "Incentive properties for ordinal mechanisms," Games and Economic Behavior, Elsevier, vol. 95(C), pages 168-177.
  121. Felix Brandt & Patrick Lederer, 2024. "Weak Strategyproofness in Randomized Social Choice," Papers 2412.11977, arXiv.org.
  122. Wu, Binzhen & Zhong, Xiaohan, 2014. "Matching mechanisms and matching quality: Evidence from a top university in China," Games and Economic Behavior, Elsevier, vol. 84(C), pages 196-215.
  123. Harless, Patrick, 2016. "Solidarity in preference aggregation: Improving on a status quo," Games and Economic Behavior, Elsevier, vol. 95(C), pages 73-87.
  124. Jens Gudmundsson, 2014. "Sequences in Pairing Problems: A new approach to reconcile stability with strategy-proofness for elementary matching problems," 2014 Papers pgu351, Job Market Papers.
  125. Zhan Wang & Jinpeng Ma & Hongwei Zhang, 2023. "Object-based unawareness: Theory and applications," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 8(1), pages 1-55, December.
  126. Felix Brandt & Patrick Lederer & Warut Suksompong, 2022. "Incentives in Social Decision Schemes with Pairwise Comparison Preferences," Papers 2204.12436, arXiv.org, revised Aug 2024.
  127. Cho, Wonki Jo, 2016. "When is the probabilistic serial assignment uniquely efficient and envy-free?," Journal of Mathematical Economics, Elsevier, vol. 66(C), pages 14-25.
  128. Alexander Nesterov, "undated". "Fairness and Efficiency in a Random Assignment: Three Impossibility Results," BDPEMS Working Papers 2014006, Berlin School of Economics.
  129. Sulagna Dasgupta & Debasis Mishra, 2022. "Ordinal Bayesian incentive compatibility in random assignment model," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 651-664, December.
  130. Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'économie 14.07, Université de Lausanne, Faculté des HEC, Département d’économie.
  131. Rasoul Ramezanian & Mehdi Feizi, 2021. "Ex-post favoring ranks: a fairness notion for the random assignment problem," Review of Economic Design, Springer;Society for Economic Design, vol. 25(3), pages 157-176, September.
  132. Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.
  133. Hikaru Kondo, 2019. "Notions of anonymity for object assignment: impossibility theorems," Review of Economic Design, Springer;Society for Economic Design, vol. 23(3), pages 113-126, December.
  134. Yusuke Narita, 2018. "Toward an Ethical Experiment," Cowles Foundation Discussion Papers 2127, Cowles Foundation for Research in Economics, Yale University.
  135. Eduardo M. Azevedo & Jacob D. Leshno, 2016. "A Supply and Demand Framework for Two-Sided Matching Markets," Journal of Political Economy, University of Chicago Press, vol. 124(5), pages 1235-1268.
  136. Basteck, Christian & Ehlers, Lars, 2021. "Strategy-Proof and Envy-Free Random Assignment," Rationality and Competition Discussion Paper Series 307, CRC TRR 190 Rationality and Competition.
  137. Che, Yeon-Koo & Tercieux, Olivier, 2018. "Payoff equivalence of efficient mechanisms in large matching markets," Theoretical Economics, Econometric Society, vol. 13(1), January.
  138. Eric van Damme & Xu Lang, 2022. "Two-Person Bargaining when the Disagreement Point is Private Information," Papers 2211.06830, arXiv.org, revised Jan 2024.
  139. Kesten, Onur & Kurino, Morimitsu & Ünver, M. Utku, 2017. "On characterizations of the probabilistic serial mechanism involving incentive and invariance properties," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 56-62.
  140. Han, Xiang, 2024. "On the efficiency and fairness of deferred acceptance with single tie-breaking," Journal of Economic Theory, Elsevier, vol. 218(C).
  141. Trifunović Dejan, 2019. "The Review of Methods for Assignment of Elective Courses at Universities," Economic Themes, Sciendo, vol. 57(4), pages 511-526, December.
  142. repec:dau:papers:123456789/167 is not listed on IDEAS
  143. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
  144. Demeulemeester, Tom & Goossens, Dries & Hermans, Ben & Leus, Roel, 2023. "A pessimist’s approach to one-sided matching," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1087-1099.
  145. Marek Pycia & M. Utku Ünver, 2022. "Outside options in neutral allocation of discrete resources," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 581-604, December.
  146. Tayfun Sönmez & M. Utku Ünver, 2024. "Matching under Non-transferable Utility: Applications," Boston College Working Papers in Economics 1069, Boston College Department of Economics.
  147. Cole, Richard & Tao, Yixin, 2021. "On the existence of Pareto Efficient and envy-free allocations," Journal of Economic Theory, Elsevier, vol. 193(C).
  148. Itai Ashlagi & Amin Saberi & Ali Shameli, 2020. "Assignment Mechanisms Under Distributional Constraints," Operations Research, INFORMS, vol. 68(2), pages 467-479, March.
  149. Eun Jeong Heo & Vikram Manjunath, 2017. "Implementation in stochastic dominance Nash equilibria," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 5-30, January.
  150. Katta, Akshay-Kumar & Sethuraman, Jay, 2006. "A solution to the random assignment problem on the full preference domain," Journal of Economic Theory, Elsevier, vol. 131(1), pages 231-250, November.
  151. Kesten, Onur, 2006. "On two competing mechanisms for priority-based allocation problems," Journal of Economic Theory, Elsevier, vol. 127(1), pages 155-171, March.
  152. Mustafa Oğuz Afacan & Inácio Bó & Bertan Turhan, 2023. "Assignment maximization," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 25(1), pages 123-138, February.
  153. Stephen Morris & Satoru Takahashi, 2011. "Common Certainty of Rationality Revisited," Working Papers 1301, Princeton University, Department of Economics, Econometric Research Program..
  154. Shunya Noda & Genta Okada, 2024. "No Screening is More Efficient with Multiple Objects," Papers 2408.10077, arXiv.org.
  155. Eric Budish & Yeon-Koo Che & Fuhito Kojima & Paul Milgrom, 2013. "Designing Random Allocation Mechanisms: Theory and Applications," American Economic Review, American Economic Association, vol. 103(2), pages 585-623, April.
  156. Yan Chen & YingHua He, 2022. "Information acquisition and provision in school choice: a theoretical investigation," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 74(1), pages 293-327, July.
  157. Huang, Chao, 2023. "Stable matching: an integer programming approach," Theoretical Economics, Econometric Society, vol. 18(1), January.
  158. Ping Zhan, 2023. "A Simple Characterization of Assignment Mechanisms on Set Constraints," SN Operations Research Forum, Springer, vol. 4(2), pages 1-15, June.
  159. repec:cup:judgdm:v:15:y:2020:i:5:p:727-740 is not listed on IDEAS
  160. Yinghua He & Antonio Miralles & Marek Pycia & Jianye Yan, 2018. "A Pseudo-Market Approach to Allocation with Priorities," American Economic Journal: Microeconomics, American Economic Association, vol. 10(3), pages 272-314, August.
  161. Antonio Miralles, "undated". "Pseudomarkets with Priorities in Large Random Assignment Economies," Working Papers 537, Barcelona School of Economics.
  162. Paul Gölz & Dominik Peters & Ariel Procaccia, 2022. "In This Apportionment Lottery, the House Always Wins," Post-Print hal-03834513, HAL.
  163. Jens Gudmundsson, 2019. "Compromises and Rewards: stable and non-manipulable probabilistic matching," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(2), pages 365-392, June.
  164. Nguyen, Thành & Peivandi, Ahmad & Vohra, Rakesh, 2016. "Assignment problems with complementarities," Journal of Economic Theory, Elsevier, vol. 165(C), pages 209-241.
  165. Alexey Kushnir, 2009. "Matching Markets with Signals," Working Papers 2009.39, Fondazione Eni Enrico Mattei.
  166. Altuntaş, Açelya & Phan, William, 2022. "Trading probabilities along cycles," Journal of Mathematical Economics, Elsevier, vol. 100(C).
  167. Greg Leo & Yevgeniy Vorobeychik & Myrna Wooders, 2023. "Subgame Perfect Coalition Formation," Dynamic Games and Applications, Springer, vol. 13(2), pages 510-524, June.
  168. Katharina Huesmann & Achim Wambach, 2015. "Constraints on Matching Markets Based on Moral Concerns," CESifo Working Paper Series 5356, CESifo.
  169. Ioannis Caragiannis & David Kurokawa & Herve Moulin & Ariel D. Procaccia & Nisarg Shah & Junxing Wang, 2016. "The Unreasonable Fairness of Maximum Nash Welfare," Working Papers 2016_08, Business School - Economics, University of Glasgow.
  170. Anna Bogomolnaia, 2015. "The Most Ordinally-Efficient of Random Voting Rules," HSE Working papers WP BRP 106/EC/2015, National Research University Higher School of Economics.
  171. Huang, Chao & Tian, Guoqiang, 2017. "Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem," Games and Economic Behavior, Elsevier, vol. 105(C), pages 1-8.
  172. Chien-Chung Huang & Telikepalli Kavitha, 2021. "Popularity, Mixed Matchings, and Self-Duality," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 405-427, May.
  173. Thomas L. Magnanti & Karthik Natarajan, 2018. "Allocating Students to Multidisciplinary Capstone Projects Using Discrete Optimization," Interfaces, INFORMS, vol. 48(3), pages 204-216, June.
  174. Harless, Patrick, 2019. "Efficient rules for probabilistic assignment," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 107-116.
  175. Jens Hougaard & Hervé Moulin & Lars Østerdal, 2010. "Decentralized pricing in minimum cost spanning trees," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 44(2), pages 293-306, August.
  176. Chen, Yan & Jiang, Ming & Kesten, Onur & Robin, Stéphane & Zhu, Min, 2018. "Matching in the large: An experimental study," Games and Economic Behavior, Elsevier, vol. 110(C), pages 295-317.
  177. Alcalde, Jose & Silva-Reus, José Ángel, 2013. "Allocating via Priorities," QM&ET Working Papers 13-3, University of Alicante, D. Quantitative Methods and Economic Theory.
  178. Yusuke Narita, 2018. "Experiment-as-Market: Incorporating Welfare into Randomized Controlled Trials," Cowles Foundation Discussion Papers 2127r, Cowles Foundation for Research in Economics, Yale University, revised May 2019.
  179. Mehdi Feizi, 2023. "The object allocation problem with favoring upper ranks," International Journal of Economic Theory, The International Society for Economic Theory, vol. 19(2), pages 370-383, June.
  180. Sulagna Dasgupta & Debasis Mishra, 2020. "Ordinal Bayesian incentive compatibility in random assignment model," Discussion Papers 20-06, Indian Statistical Institute, Delhi.
  181. Bade, Sophie, 2016. "Fairness and group-strategyproofness clash in assignment problems," Journal of Economic Theory, Elsevier, vol. 165(C), pages 257-262.
  182. Fedor Sandomirskiy & Erel Segal-Halevi, 2019. "Efficient Fair Division with Minimal Sharing," Papers 1908.01669, arXiv.org, revised Apr 2022.
  183. Kesten, Onur, 2009. "Why do popular mechanisms lack efficiency in random environments?," Journal of Economic Theory, Elsevier, vol. 144(5), pages 2209-2226, September.
  184. Monte, Daniel & Tumennasan, Norovsambuu, 2015. "Centralized allocation in multiple markets," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 74-85.
  185. Marek Pycia & M. Utku Ünver, 2021. "Arrovian Efficiency and Auditability in Discrete Mechanism Design," Boston College Working Papers in Economics 1044, Boston College Department of Economics.
  186. Alcalde, Jose, 2013. "Random Housing with Existing Tenants," QM&ET Working Papers 13-5, University of Alicante, D. Quantitative Methods and Economic Theory.
  187. Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2014. "Assigning agents to a line," Games and Economic Behavior, Elsevier, vol. 87(C), pages 539-553.
  188. Harless, Patrick & Phan, William, 2022. "Efficient mixtures of priority rules for assigning objects," Games and Economic Behavior, Elsevier, vol. 132(C), pages 73-89.
  189. Ariel Rosenfeld & Avinatan Hassidim, 2020. "Too smart for their own good: Trading truthfulness for efficiency in the Israeli medical internship market," Judgment and Decision Making, Society for Judgment and Decision Making, vol. 15(5), pages 727-740, September.
  190. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
  191. Anno, Hidekazu & Kurino, Morimitsu, 2016. "On the operation of multiple matching markets," Games and Economic Behavior, Elsevier, vol. 100(C), pages 166-185.
  192. Fuhito Kojima & M. Ünver, 2014. "The “Boston” school-choice mechanism: an axiomatic approach," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 55(3), pages 515-544, April.
  193. Chambers, Christopher P. & Echenique, Federico, 0. "Empirical welfare economics," Theoretical Economics, Econometric Society.
  194. Xiaohui Bei & Guangda Huzhang & Warut Suksompong, 2020. "Truthful fair division without free disposal," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 55(3), pages 523-545, October.
  195. Onur Kesten & Ayşe Yazıcı, 2012. "The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 50(2), pages 463-488, June.
  196. Erya Yang, 2021. "Reduced-form mechanism design and ex post fairness constraints," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 9(2), pages 269-293, October.
  197. Dur, Umut & Hammond, Robert G. & Kesten, Onur, 2021. "Sequential school choice: Theory and evidence from the field and lab," Journal of Economic Theory, Elsevier, vol. 198(C).
  198. Georgios Gerasimou, 2019. "Simple Preference Intensity Comparisons," Discussion Paper Series, School of Economics and Finance 201905, School of Economics and Finance, University of St Andrews, revised 27 Apr 2020.
  199. Christian Basteck, 2024. "An Axiomatization of the Random Priority Rule," Rationality and Competition Discussion Paper Series 502, CRC TRR 190 Rationality and Competition.
  200. Eirinakis, Pavlos & Mourtos, Ioannis & Zampou, Eleni, 2022. "Random Serial Dictatorship for horizontal collaboration in logistics," Omega, Elsevier, vol. 111(C).
  201. Kojima Fuhito, 2007. "When Can Manipulations be Avoided in Two-Sided Matching Markets? -- Maximal Domain Results," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 7(1), pages 1-18, September.
  202. Marco Chiarandini & Rolf Fagerberg & Stefano Gualandi, 2019. "Handling preferences in student-project allocation," Annals of Operations Research, Springer, vol. 275(1), pages 39-78, April.
  203. Stephen Morris & Satoru Takahashi, 2012. "Games in Preference Form and Preference Rationalizability," Working Papers 1420, Princeton University, Department of Economics, Econometric Research Program..
  204. Afacan, Mustafa Oǧuz, 2018. "The object allocation problem with random priorities," Games and Economic Behavior, Elsevier, vol. 110(C), pages 71-89.
  205. Chen, Yan & He, YingHua, 2021. "Information acquisition and provision in school choice: An experimental study," Journal of Economic Theory, Elsevier, vol. 197(C).
  206. Azrieli, Yaron & Jain, Ritesh, 2018. "Symmetric mechanism design," Journal of Mathematical Economics, Elsevier, vol. 74(C), pages 108-118.
  207. Nikhil Agarwal & Eric Budish, 2021. "Market Design," NBER Working Papers 29367, National Bureau of Economic Research, Inc.
  208. Youngsub Chun & Boram Park, 2017. "A graph theoretic approach to the slot allocation problem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 133-152, January.
  209. Florian Brandl & Felix Brandt & Christian Stricker, 2022. "An analytical and experimental comparison of maximal lottery schemes," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 58(1), pages 5-38, January.
  210. Julien Grenet & Yinghua He & Dorothea Kübler, 2022. "Preference Discovery in University Admissions: The Case for Dynamic Multioffer Mechanisms," PSE-Ecole d'économie de Paris (Postprint) hal-04157650, HAL.
  211. Heo, Eun Jeong & Yılmaz, Özgür, 2015. "A characterization of the extended serial correspondence," Journal of Mathematical Economics, Elsevier, vol. 59(C), pages 102-110.
  212. Felix Brandt & Patrick Lederer & Ren'e Romen, 2022. "Relaxed Notions of Condorcet-Consistency and Efficiency for Strategyproof Social Decision Schemes," Papers 2201.10418, arXiv.org.
  213. Ping Zhan, 2023. "Simultaneous eating algorithm and greedy algorithm in assignment problems," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-24, July.
  214. Hafalir, Isa & Miralles, Antonio, 2015. "Welfare-maximizing assignment of agents to hierarchical positions," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 253-270.
  215. Fujinaka, Yuji & Miyakawa, Toshiji, 2020. "Ex-post incentive compatible and individually rational assignments in housing markets with interdependent values," Journal of Mathematical Economics, Elsevier, vol. 91(C), pages 157-164.
  216. Saban, Daniela & Sethuraman, Jay, 2014. "A note on object allocation under lexicographic preferences," Journal of Mathematical Economics, Elsevier, vol. 50(C), pages 283-289.
  217. Yoon, Kiho, 2011. "Optimal mechanism design when both allocative inefficiency and expenditure inefficiency matter," Journal of Mathematical Economics, Elsevier, vol. 47(6), pages 670-676.
  218. Aziz, Haris & Brandl, Florian & Brandt, Felix & Brill, Markus, 2018. "On the tradeoff between efficiency and strategyproofness," Games and Economic Behavior, Elsevier, vol. 110(C), pages 1-18.
  219. Hernandez-Chanto Allan, 2020. "College Assignment Problems Under Constrained Choice, Private Preferences, and Risk Aversion," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 20(2), pages 1-20, June.
  220. Irene Aldridge, 2024. "Fast TTC Computation," Papers 2403.15111, arXiv.org.
  221. Tom Demeulemeester & Juan S. Pereyra, 2022. "Rawlsian Assignments," Papers 2207.02930, arXiv.org, revised Oct 2024.
  222. Haris Aziz & Bettina Klaus, 2017. "Random Matching under Priorities: Stability and No Envy Concepts," Cahiers de Recherches Economiques du Département d'Econométrie et d'Economie politique (DEEP) 17.09, Université de Lausanne, Faculté des HEC, DEEP.
  223. Le, Phuong, 2013. "Competitive Equilibrium in the Random Assignment Problem," MPRA Paper 66290, University Library of Munich, Germany.
  224. Brandt, Felix & Lederer, Patrick & Suksompong, Warut, 2023. "Incentives in social decision schemes with pairwise comparison preferences," Games and Economic Behavior, Elsevier, vol. 142(C), pages 266-291.
  225. Ioannis Panageas & Thorben Trobst & Vijay V. Vazirani, 2021. "Time-Efficient Algorithms for Nash-Bargaining-Based Matching Market Models," Papers 2106.02024, arXiv.org, revised Nov 2024.
  226. Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
  227. Xu Lang & Zaifu Yang, 2021. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints: A Revision," Discussion Papers 21/05, Department of Economics, University of York.
  228. Fuhito Kojima & Parag A. Pathak, 2009. "Incentives and Stability in Large Two-Sided Matching Markets," American Economic Review, American Economic Association, vol. 99(3), pages 608-627, June.
  229. Julien Grenet & Yinghua He & Dorothea Kübler, 2022. "Preference Discovery in University Admissions: The Case for Dynamic Multioffer Mechanisms," Post-Print hal-04157650, HAL.
  230. Tetsutaro Hatakeyama & Onur Kesten & Morimitsu Kurino, 2024. "Who makes the cut? Endogenous priority design for heterogeneous groups of agents," Keio-IES Discussion Paper Series 2024-023, Institute for Economics Studies, Keio University.
  231. Federico Echenique & Antonio Miralles & Jun Zhang, 2018. "Fairness and Efficiency for Probabilistic Allocations with Endowments," Working Papers 1055, Barcelona School of Economics.
  232. Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.
  233. Martini, Giorgio, 2016. "Strategy-proof and fair assignment is wasteful," Games and Economic Behavior, Elsevier, vol. 98(C), pages 172-179.
  234. Hoon Oh & Yanhan Tang & Zong Zhang & Alexandre Jacquillat & Fei Fang, 2021. "Efficiency, Fairness, and Stability in Non-Commercial Peer-to-Peer Ridesharing," Papers 2110.01152, arXiv.org, revised Jun 2023.
  235. Hashimoto, Tadashi & Hirata, Daisuke & Kesten, Onur & Kurino, Morimitsu & Unver, Utku, 2014. "Two axiomatic approaches to the probabilistic serial mechanism," Theoretical Economics, Econometric Society, vol. 9(1), January.
  236. Yoshio Sano & Ping Zhan, 2021. "Extended Random Assignment Mechanisms on a Family of Good Sets," SN Operations Research Forum, Springer, vol. 2(4), pages 1-30, December.
  237. He, Yinghua, 2012. "Gaming the Boston School Choice Mechanism in Beijing," TSE Working Papers 12-345, Toulouse School of Economics (TSE).
  238. Sophie Bade & Joseph Root, 2023. "Royal Processions: Incentives, Efficiency and Fairness in Two-sided Matching," Papers 2301.13037, arXiv.org.
  239. Thanh Nguyen & Ahmad Peivandi & Rakesh Vohra, 2014. "One-Sided Matching with Limited Complementarities," PIER Working Paper Archive 14-030, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
  240. Morrill, Thayer, 2015. "Making just school assignments," Games and Economic Behavior, Elsevier, vol. 92(C), pages 18-27.
  241. Steven Kivinen, 2024. "Weak Equity," Graz Economics Papers 2024-04, University of Graz, Department of Economics.
  242. Carroll, Gabriel, 2010. "An efficiency theorem for incompletely known preferences," Journal of Economic Theory, Elsevier, vol. 145(6), pages 2463-2470, November.
  243. Shengwu Li, 2024. "Designing Simple Mechanisms," Papers 2403.18694, arXiv.org, revised Jul 2024.
  244. Forges, Francoise, 2004. "The ex ante incentive compatible core of the assignment game," Mathematical Social Sciences, Elsevier, vol. 47(2), pages 135-151, March.
  245. Holzer, Jorge & McConnell, Kenneth, 2023. "Extraction rights allocation with liquidity constraints," Resource and Energy Economics, Elsevier, vol. 71(C).
  246. Han, Xiang, 2024. "A theory of fair random allocation under priorities," Theoretical Economics, Econometric Society, vol. 19(3), July.
  247. Christian Ackermann & Felix Hahne & Julia Rieck, 2022. "Matching and Scheduling of Student-Company-Talks for a University IT-Speed Dating Event," SN Operations Research Forum, Springer, vol. 3(3), pages 1-29, September.
  248. Haris Aziz & Xinhang Lu & Mashbat Suzuki & Jeremy Vollen & Toby Walsh, 2023. "Best-of-Both-Worlds Fairness in Committee Voting," Papers 2303.03642, arXiv.org, revised Dec 2023.
  249. Altuntaş, Açelya & Phan, William & Tamura, Yuki, 2023. "Some characterizations of Generalized Top Trading Cycles," Games and Economic Behavior, Elsevier, vol. 141(C), pages 156-181.
  250. Kesten, Onur & Unver, Utku, 2015. "A theory of school choice lotteries," Theoretical Economics, Econometric Society, vol. 10(2), May.
  251. Mustafa Oğuz Afacan, 2023. "Axiomatic characterizations of the constrained probabilistic serial mechanism," Theory and Decision, Springer, vol. 95(3), pages 465-484, October.
  252. Shengwu Li, 2017. "Ethics and market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 705-720.
  253. Alva, Samson & Manjunath, Vikram, 2020. "The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching," Games and Economic Behavior, Elsevier, vol. 119(C), pages 15-29.
  254. Chang, Hee-In & Chun, Youngsub, 2017. "Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 80-92.
  255. Heo, Eun Jeong, 2014. "Probabilistic assignment problem with multi-unit demands: A generalization of the serial rule and its characterization," Journal of Mathematical Economics, Elsevier, vol. 54(C), pages 40-47.
  256. Wonki Jo Cho & Alejandro Saporiti, 2015. "Incentives, Fairness, and Efficiency in Group Identification," Economics Discussion Paper Series 1501, Economics, The University of Manchester.
  257. Ivan Balbuzanov, 2016. "Convex strategyproofness with an application to the probabilistic serial mechanism," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(3), pages 511-520, March.
  258. Pycia, Marek & Ãœnver, M. Utku, 2020. "Arrovian Efficiency and Auditability in the Allocation of Discrete Resources," CEPR Discussion Papers 15377, C.E.P.R. Discussion Papers.
  259. repec:cty:dpaper:18702 is not listed on IDEAS
  260. Noda, Shunya, 2023. "A planner-optimal matching mechanism and its incentive compatibility in a restricted domain," Games and Economic Behavior, Elsevier, vol. 141(C), pages 364-379.
  261. Jingsheng Yu & Jun Zhang, 2020. "Fractional Top Trading Cycle on the Full Preference Domain," Papers 2005.09340, arXiv.org.
  262. Yajing Chen & Patrick Harless & Zhenhua Jiao, 2021. "The probabilistic rank random assignment rule and its axiomatic characterization," Papers 2104.09165, arXiv.org.
  263. Wonki Jo Cho, 2018. "Probabilistic assignment: an extension approach," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(1), pages 137-162, June.
  264. Francoise Forges, 2006. "The Ex Ante Incentive Compatible Core in Exchange Economies with and without Indivisibilities," CESifo Working Paper Series 1686, CESifo.
  265. Aperjis, Christina & Kotowski, Maciej & Zeckhauser, Richard, 2019. "Efficient Division When Preferences are Private: Using the Expected Externality Mechanism," Working Paper Series rwp19-014, Harvard University, John F. Kennedy School of Government.
  266. Yasushi Kawase & Hanna Sumita & Yu Yokoi, 2022. "Random Assignment of Indivisible Goods under Constraints," Papers 2208.07666, arXiv.org, revised Dec 2024.
  267. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
  268. Hikaru Kondo & Shigehiro Serizawa, 2015. "Notions of anonymity for object assignment: impossibility theorems," ISER Discussion Paper 0927, Institute of Social and Economic Research, Osaka University.
  269. Haris Aziz, 2014. "A characterization of stochastic dominance efficiency," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(2), pages 205-212, October.
  270. Martin Bichler & Soeren Merting, 2021. "Randomized Scheduling Mechanisms: Assigning Course Seats in a Fair and Efficient Way," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3540-3559, October.
  271. Di Feng & Jacob Coreno, 2024. "Justified Fairness in House Allocation Problems: two Characterizations of Strategy-proof Mechanisms," Papers 2407.14101, arXiv.org.
  272. Esmerok, İbrahim Barış, 2015. "Random scheduling with deadlines under dichotomous preferences," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 96-103.
  273. Itai Ashlagi & Peng Shi, 2016. "Optimal Allocation Without Money: An Engineering Approach," Management Science, INFORMS, vol. 62(4), pages 1078-1097, April.
  274. Xiaohui Bei & Guangda Huzhang & Warut Suksompong, 2018. "Truthful Fair Division without Free Disposal," Papers 1804.06923, arXiv.org, revised Apr 2020.
  275. Zhang, Jun, 2019. "Efficient and fair assignment mechanisms are strongly group manipulable," Journal of Economic Theory, Elsevier, vol. 180(C), pages 167-177.
  276. Haris Aziz & Yoichi Kasajima, 2017. "Impossibilities for probabilistic assignment," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 255-275, August.
  277. Tijs, Stef & Borm, Peter & Lohmann, Edwin & Quant, Marieke, 2011. "An average lexicographic value for cooperative games," European Journal of Operational Research, Elsevier, vol. 213(1), pages 210-220, August.
  278. Mustafa Oguz Afacan & Umut Dur & A. Arda Gitmez & Ozgur Y{i}lmaz, 2022. "Improving the Deferred Acceptance with Minimal Compromise," Papers 2205.00032, arXiv.org, revised Sep 2023.
  279. Haris Aziz, 2016. "A generalization of the AL method for fair allocation of indivisible objects," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 4(2), pages 307-324, October.
  280. Sebastian Montano Correa, 2015. "Compulsory Social Service Matching Market for Physicians in Colombia," Documentos CEDE 12856, Universidad de los Andes, Facultad de Economía, CEDE.
  281. Moshe Babaioff & Uriel Feige, 2019. "A New Approach to Fair Distribution of Welfare," Papers 1909.11346, arXiv.org.
  282. Jingsheng Yu & Jun Zhang, 2020. "Efficient and fair trading algorithms in market design environments," Papers 2005.06878, arXiv.org, revised May 2021.
  283. Chatterji, Shurojit & Liu, Peng, 2020. "Random assignments of bundles," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 15-30.
  284. Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
  285. X. Ruiz del Portal, 2012. "Conditions for incentive compatibility in models with multidimensional allocation functions and one-dimensional types," Review of Economic Design, Springer;Society for Economic Design, vol. 16(4), pages 311-321, December.
  286. Eric Budish & Judd B. Kessler, 2016. "Can Market Participants Report their Preferences Accurately (Enough)?," NBER Working Papers 22448, National Bureau of Economic Research, Inc.
  287. Marek Bojko, 2020. "The Probabilistic Serial and Random Priority Mechanisms with Minimum Quotas," Papers 2012.11028, arXiv.org.
  288. Benedict Dellaert & Vladislav Golounov & Jaideep Prabhu, 2005. "The Impact of Price Disclosure on Dynamic Shopping Decisions," Marketing Letters, Springer, vol. 16(1), pages 37-52, January.
  289. EHLERS, Lars & MAJUMDAR, Dipjyoti & MISHRA, Debasis & SEN, Arunava, 2016. "Continuity and incentive compatibility," Cahiers de recherche 2016-04, Universite de Montreal, Departement de sciences economiques.
  290. Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).
  291. Afacan, Mustafa Oǧuz, 2013. "Alternative characterizations of Boston mechanism," Mathematical Social Sciences, Elsevier, vol. 66(2), pages 176-179.
  292. Mustafa Oğuz Afacan & Umut Dur, 2023. "Strategy‐proof size improvement: is it possible?," Scandinavian Journal of Economics, Wiley Blackwell, vol. 125(2), pages 321-338, April.
  293. Chambers, Christopher P., 2004. "Consistency in the probabilistic assignment model," Journal of Mathematical Economics, Elsevier, vol. 40(8), pages 953-962, December.
  294. Marta Boczoń & Alistair J. Wilson, 2023. "Goals, Constraints, and Transparently Fair Assignments: A Field Study of Randomization Design in the UEFA Champions League," Management Science, INFORMS, vol. 69(6), pages 3474-3491, June.
  295. Cho, Wonki Jo & Doğan, Battal, 2016. "Equivalence of efficiency notions for ordinal assignment problems," Economics Letters, Elsevier, vol. 146(C), pages 8-12.
  296. Peng Shi, 2022. "Optimal Priority-Based Allocation Mechanisms," Management Science, INFORMS, vol. 68(1), pages 171-188, January.
  297. Simina Br^anzei & Fedor Sandomirskiy, 2019. "Algorithms for Competitive Division of Chores," Papers 1907.01766, arXiv.org, revised Jul 2023.
  298. Andrew McLennan & Shino Takayama & Yuki Tamura, 2024. "An Efficient, Computationally Tractable School Choice Mechanism," Discussion Papers Series 668, School of Economics, University of Queensland, Australia.
  299. Eric Budish, 2011. "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes," Journal of Political Economy, University of Chicago Press, vol. 119(6), pages 1061-1103.
  300. Doğan, Battal & Doğan, Serhat & Yıldız, Kemal, 2018. "A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 175(C), pages 178-200.
  301. Anna Bogomolnaia & Herve Moulin, 2023. "Fair congested assignment problem," Papers 2301.12163, arXiv.org, revised Feb 2024.
  302. Cubukcu, K. Mert, 2020. "The problem of fair division of surplus development rights in redevelopment of urban areas: Can the Shapley value help?," Land Use Policy, Elsevier, vol. 91(C).
  303. Bogomolnaia, Anna & Deb, Rajat & Ehlers, Lars, 2005. "Strategy-proof assignment on the full preference domain," Journal of Economic Theory, Elsevier, vol. 123(2), pages 161-186, August.
  304. Noda, Shunya, 2020. "Size versus truncation robustness in the assignment problem," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 1-5.
  305. Th`anh Nguyen & Alexander Teytelboym & Shai Vardi, 2023. "Dynamic Combinatorial Assignment," Papers 2303.13967, arXiv.org.
  306. Eun Heo, 2014. "The extended serial correspondence on a rich preference domain," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(2), pages 439-454, May.
  307. Thayer Morrill, 2015. "Two simple variations of top trading cycles," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(1), pages 123-140, September.
  308. Xu Lang & Zaifu Yang, 2023. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints," Discussion Papers 23/02, Department of Economics, University of York.
  309. Karmokar, Madhuparna & Majumdar, Dipjyoti & Roy, Souvik, 2024. "Some further results on random OBIC rules," Mathematical Social Sciences, Elsevier, vol. 131(C), pages 102-112.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.