IDEAS home Printed from https://ideas.repec.org/r/pra/mprapa/24351.html
   My bibliography  Save this item

House allocation with fractional endowments

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. 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.
  3. 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.
  4. YIlmaz, Özgür, 2009. "Random assignment under weak preferences," Games and Economic Behavior, Elsevier, vol. 66(1), pages 546-558, May.
  5. Hiroaki Shinkawa & Nicolas Chauvet & Guillaume Bachelier & Andr'e Rohm & Ryoichi Horisaki & Makoto Naruse, 2022. "Optimal preference satisfaction for conflict-free joint decisions," Papers 2205.00799, arXiv.org.
  6. Echenique, Federico & Miralles, Antonio & Zhang, Jun, 2021. "Fairness and efficiency for allocations with participation constraints," Journal of Economic Theory, Elsevier, vol. 195(C).
  7. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
  8. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
  9. 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.
  10. 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.
  11. 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.
  12. Cechlárová, Katarína & Fleiner, Tamás, 2017. "Pareto optimal matchings with lower quotas," Mathematical Social Sciences, Elsevier, vol. 88(C), pages 3-10.
  13. 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.
  14. 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.
  15. Tommy ANDERSSON & Ágnes CSEH & Lars EHLERS & Albin ERLANSON, 2018. "Organizing Time Banks : Lessons from Matching Markets," Cahiers de recherche 11-2018, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
  16. 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.
  17. Altuntaş, Açelya & Phan, William, 2022. "Trading probabilities along cycles," Journal of Mathematical Economics, Elsevier, vol. 100(C).
  18. Tayfun Sönmez & M. Utku Ünver, 2015. "Enhancing the Efficiency of and Equity in Transplant Organ Allocation via Incentivized Exchange," Boston College Working Papers in Economics 868, Boston College Department of Economics.
  19. 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.
  20. Echenique, Federico & Miralles, Antonio & Zhang, Jun, 2023. "Balanced equilibrium in pseudo-markets with endowments," Games and Economic Behavior, Elsevier, vol. 141(C), pages 428-443.
  21. Le, Phuong, 2013. "Competitive Equilibrium in the Random Assignment Problem," MPRA Paper 66290, University Library of Munich, Germany.
  22. C. Gizem Korpeoglu, 2018. "Allocation of an indivisible object on the full preference domain: axiomatic characterizations," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 6(1), pages 41-53, April.
  23. 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.
  24. Han, Xiang, 0. "A theory of fair random allocation under priorities," Theoretical Economics, Econometric Society.
  25. Kesten, Onur & Unver, Utku, 2015. "A theory of school choice lotteries," Theoretical Economics, Econometric Society, vol. 10(2), May.
  26. 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.
  27. Nesterov, Alexander S., 2017. "Fairness and efficiency in strategy-proof object allocation mechanisms," Journal of Economic Theory, Elsevier, vol. 170(C), pages 145-168.
  28. 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.
  29. Jingsheng Yu & Jun Zhang, 2020. "Efficient and fair trading algorithms in market design environments," Papers 2005.06878, arXiv.org, revised May 2021.
  30. Basteck, Christian, 2018. "Fair solutions to the random assignment problem," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 163-172.
  31. 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.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.