My bibliography
Save this item
On a conjecture by gale about one-sided matching problems
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Federico Echenique & Antonio Miralles & Jun Zhang, 2019. "Fairness and efficiency for probabilistic allocations with participation constraints," Papers 1908.04336, arXiv.org, revised May 2020.
- 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.
- YIlmaz, Özgür, 2009. "Random assignment under weak preferences," Games and Economic Behavior, Elsevier, vol. 66(1), pages 546-558, May.
- Rafael Hortala-Vallve, 2010.
"Inefficiencies on linking decisions,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 34(3), pages 471-486, March.
- Rafael Hortala-Vallve, 2007. "Inefficiencies on Linking Decisions," Economics Series Working Papers 321, University of Oxford, Department of Economics.
- Erdil, Aytek, 2014. "Strategy-proof stochastic assignment," Journal of Economic Theory, Elsevier, vol. 151(C), pages 146-162.
- 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.
- Feizi, Mehdi & Ramezanian, Rasoul, 2023. "A new impossibility result for random assignments," Journal of Mathematical Economics, Elsevier, vol. 107(C).
- 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.
- YIlmaz, Özgür, 2010. "The probabilistic serial mechanism with private endowments," Games and Economic Behavior, Elsevier, vol. 69(2), pages 475-491, July.
- He, Yinghua & Li, Sanxi & Yan, Jianye, 2015.
"Evaluating assignment without transfers: A market perspective,"
Economics Letters, Elsevier, vol. 133(C), pages 40-44.
- He, Yinghua & Li, Sanxi & Yan, Jianye, 2015. "Evaluating Assignment without Transfers: A Market Perspective," TSE Working Papers 15-559, Toulouse School of Economics (TSE).
- 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.
- AZIZ, Haris & HOUGAARD, Jens Leth & MORENO-TERNERO, Juan D. & OSTERDAL, Lars Peter, 2016. "Computational Aspects of Assigning Agents to a Line," LIDAM Discussion Papers CORE 2016054, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Haris Aziz & Jens L. Hougaard & Juan D. Moreno-Ternero & Lars P. Osterdal, 2017. "Computational aspects of assigning agents to a line," Working Papers 17.03, Universidad Pablo de Olavide, Department of Economics.
- Haris Aziz & Jens Leth Hougaard & Juan D. Moreno-Ternero & Lars Peter Osterdal, 2017. "Computational aspects of assigning agents to a line," LIDAM Reprints CORE 2915, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Akyol, Ethem, 2023. "Inefficiency of Random Serial Dictatorship under incomplete information," Journal of Economic Theory, Elsevier, vol. 213(C).
- Echenique, Federico & Miralles, Antonio & Zhang, Jun, 2021. "Fairness and efficiency for allocations with participation constraints," Journal of Economic Theory, Elsevier, vol. 195(C).
- 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.
- Zhang, Jun, 2023. "Strategy-proof allocation with outside option," Games and Economic Behavior, Elsevier, vol. 137(C), pages 50-67.
- Zhang, Jun, 2020. "When are efficient and fair assignment mechanisms group strategy-proof?," Games and Economic Behavior, Elsevier, vol. 119(C), pages 251-266.
- Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
- McLennan, Andrew, 2002. "Ordinal Efficiency and the Polyhedral Separating Hyperplane Theorem," Journal of Economic Theory, Elsevier, vol. 105(2), pages 435-449, August.
- 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.
- 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.
- 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.
- Kesten, Onur & Kurino, Morimitsu & Nesterov, Alexander, 2015. "Efficient lottery design," Discussion Papers, Research Unit: Market Behavior SP II 2015-203, WZB Berlin Social Science Center.
- Hashimoto, Tadashi, 2018. "The generalized random priority mechanism with budgets," Journal of Economic Theory, Elsevier, vol. 177(C), pages 708-733.
- 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.
- Tayfun Sönmez & M. Utku Ünver, 2001. "House Allocation with Existing Tenants: An Equivalence," Game Theory and Information 0112002, University Library of Munich, Germany, revised 17 Mar 2004.
- Abdulkadiroglu, Atila & Sonmez, Tayfun, 2003. "Ordinal efficiency and dominated sets of assignments," Journal of Economic Theory, Elsevier, vol. 112(1), pages 157-172, September.
- Tommy Andersson & Lars‐Gunnar Svensson, 2014.
"Non‐Manipulable House Allocation With Rent Control,"
Econometrica, Econometric Society, vol. 82(2), pages 507-539, March.
- Andersson, Tommy & Svensson, Lars-Gunnar, 2012. "Non-Manipulable House Allocation with Rent Control," Working Papers 2012:18, Lund University, Department of Economics, revised 18 Sep 2013.
- 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.
- 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.
- Cho, Wonki Jo & Thomson, William, 2023. "Strategy-proofness in private good economies with linear preferences: An impossibility result," Games and Economic Behavior, Elsevier, vol. 142(C), pages 1012-1017.
- 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.
- Miyagawa, Eiichi, 2002. "Strategy-Proofness and the Core in House Allocation Problems," Games and Economic Behavior, Elsevier, vol. 38(2), pages 347-361, February.
- Kawaguchi, Riho & Yanagisawa, Daichi & Nishinari, Katsuhiro, 2019. "Decision-making with reference information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 519(C), pages 109-118.
- Kesten, Onur, 2009. "Why do popular mechanisms lack efficiency in random environments?," Journal of Economic Theory, Elsevier, vol. 144(5), pages 2209-2226, September.
- 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.
- Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2012. "Assigning agents to a line," Discussion Papers on Economics 11/2012, University of Southern Denmark, Department of Economics.
- HOUGAARD, Jens L. & moreno-ternero, JUAN D. & OSTERDAL, Lars P., 2013. "Assigning agents to a line," LIDAM Discussion Papers CORE 2013015, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- HOUGAARD, Jens Leth & MORENO-TERNERO, Juan D & OSTERDAL, Lars Peter, 2014. "Assigning agents to a line," LIDAM Reprints CORE 2631, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Jens L. Hougaard & Juan D. Moreno-Ternero & Lars P. Osterdal, 2014. "Assigning agents to a line," Working Papers 14.01, Universidad Pablo de Olavide, Department of Economics.
- 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.
- Afacan, Mustafa Oǧuz, 2018. "The object allocation problem with random priorities," Games and Economic Behavior, Elsevier, vol. 110(C), pages 71-89.
- Gan, Jiarui & Suksompong, Warut & Voudouris, Alexandros A., 2019. "Envy-freeness in house allocation problems," Mathematical Social Sciences, Elsevier, vol. 101(C), pages 104-106.
- Miyagawa, Eiichi, 2001. "House Allocation with Transfers," Journal of Economic Theory, Elsevier, vol. 100(2), pages 329-355, October.
- Tom Demeulemeester & Juan S. Pereyra, 2022. "Rawlsian Assignments," Papers 2207.02930, arXiv.org, revised Oct 2024.
- Manea, Mihai, 2007. "Serial dictatorship and Pareto optimality," Games and Economic Behavior, Elsevier, vol. 61(2), pages 316-330, November.
- Federico Echenique & Antonio Miralles & Jun Zhang, 2018. "Fairness and Efficiency for Probabilistic Allocations with Endowments," Working Papers 1055, Barcelona School of Economics.
- Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
- 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.
- 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.
- Nesterov, Alexander S., 2017. "Fairness and efficiency in strategy-proof object allocation mechanisms," Journal of Economic Theory, Elsevier, vol. 170(C), pages 145-168.
- 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.
- Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
- Yan Chen & Tayfun Sönmez, 2002. "Improving Efficiency of On-Campus Housing: An Experimental Study," American Economic Review, American Economic Association, vol. 92(5), pages 1669-1686, December.
- Zhang, Jun, 2019. "Efficient and fair assignment mechanisms are strongly group manipulable," Journal of Economic Theory, Elsevier, vol. 180(C), pages 167-177.
- Wu, Binzhen & Zhong, Xiaohan, 2020. "Matching inequality and strategic behavior under the Boston mechanism: Evidence from China's college admissions," Games and Economic Behavior, Elsevier, vol. 123(C), pages 1-21.
- 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.
- Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).
- Chambers, Christopher P., 2004. "Consistency in the probabilistic assignment model," Journal of Mathematical Economics, Elsevier, vol. 40(8), pages 953-962, December.
- 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.