IDEAS home Printed from https://ideas.repec.org/r/spr/sochwe/v21y2003i2p265-280.html
   My bibliography  Save this item

Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems

Citations

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


Cited by:

  1. James Schummer & Rakesh V. Vohra, 2013. "Assignment of Arrival Slots," American Economic Journal: Microeconomics, American Economic Association, vol. 5(2), pages 164-185, May.
  2. 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.
  3. Gian Caspari, 2023. "A market design solution to a multi-category housing allocation problem," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 8(1), pages 75-96, December.
  4. Masahiro KAWASAKI & Ryosuke SAKAI & Tomoya KAZUMURA, 2023. "Sequential dictatorship rules in multi-unit objectassignment problems with money," Discussion papers e-23-007, Graduate School of Economics , Kyoto University.
  5. Jiao, Zhenhua & Tian, Guoqiang & Chen, Songqing & Yang, Fei, 2016. "The blocking lemma and group incentive compatibility for matching with contracts," Mathematical Social Sciences, Elsevier, vol. 82(C), pages 65-71.
  6. 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.
  7. Yuji Fujinaka & Takuma Wakayama, 2011. "Secure implementation in Shapley–Scarf housing markets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 48(1), pages 147-169, September.
  8. Antonio Romero-Medina & Matteo Triossi, 2021. "Two-sided strategy-proofness in many-to-many matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(1), pages 105-118, March.
  9. Eve Ramaekers, 2013. "Fair allocation of indivisible goods: the two-agent case," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(2), pages 359-380, July.
  10. 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.
  11. Miralles, Antonio, 2012. "Cardinal Bayesian allocation mechanisms without transfers," Journal of Economic Theory, Elsevier, vol. 147(1), pages 179-206.
  12. Bichler, Martin & Merting, Sören, 2018. "Truthfulness in advertising? Approximation mechanisms for knapsack bidders," European Journal of Operational Research, Elsevier, vol. 270(2), pages 775-783.
  13. Lars Ehlers & Bettina Klaus, 2003. "Resource-Monotonicity for House Allocation," Working Papers 33, Barcelona School of Economics.
  14. Afacan, Mustafa Oğuz & Bó, Inácio, 2022. "Strategy-proof popular mechanisms," Journal of Mathematical Economics, Elsevier, vol. 102(C).
  15. Markus Möller, 2024. "Transparent Matching Mechanisms," ECONtribute Discussion Papers Series 306, University of Bonn and University of Cologne, Germany.
  16. Doğan, Battal, 2016. "Responsive affirmative action in school choice," Journal of Economic Theory, Elsevier, vol. 165(C), pages 69-105.
  17. Di Feng & Bettina Klaus, 2022. "Preference revelation games and strict cores of multiple‐type housing market problems," International Journal of Economic Theory, The International Society for Economic Theory, vol. 18(1), pages 61-76, March.
  18. Anna Bogomolnaia & Herve Moulin, 2004. "Random Matching Under Dichotomous Preferences," Econometrica, Econometric Society, vol. 72(1), pages 257-279, January.
  19. 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).
  20. Ehlers, Lars, 2002. "Coalitional Strategy-Proof House Allocation," Journal of Economic Theory, Elsevier, vol. 105(2), pages 298-317, August.
  21. Chen, Yajing & Jiao, Zhenhua & Zhang, Yang & Zhao, Fang, 2021. "Resource allocation on the basis of priorities under multi-unit demand," Economics Letters, Elsevier, vol. 202(C).
  22. 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.
  23. Juarez, Ruben, 2013. "Group strategyproof cost sharing: The role of indifferences," Games and Economic Behavior, Elsevier, vol. 82(C), pages 218-239.
  24. Mireille Ducassé & Peggy Cellier, 2016. "Using Bids, Arguments and Preferences in Sensitive Multi-unit Assignments: A p-Equitable Process and a Course Allocation Case Study," Group Decision and Negotiation, Springer, vol. 25(6), pages 1211-1235, November.
  25. 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.
  26. Biró, Péter & Klijn, Flip & Pápai, Szilvia, 2022. "Serial Rules in a Multi-Unit Shapley-Scarf Market," Games and Economic Behavior, Elsevier, vol. 136(C), pages 428-453.
  27. Antonio Romero-Medina & Matteo Triossi, 2017. "(Group) Strategy-proofness and stability in many-to many marching markets," Documentos de Trabajo 332, Centro de Economía Aplicada, Universidad de Chile.
  28. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
  29. Papai, Szilvia, 2007. "Exchange in a general market with indivisible goods," Journal of Economic Theory, Elsevier, vol. 132(1), pages 208-235, January.
  30. Honda, Edward, 2021. "A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences," Journal of Mathematical Economics, Elsevier, vol. 94(C).
  31. 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.
  32. Martínez, Ruth & Massó, Jordi & Neme, Alejandro & Oviedo, Jorge, 2010. "The Blocking Lemma for a many-to-one matching model," Journal of Mathematical Economics, Elsevier, vol. 46(5), pages 937-949, September.
  33. Romero-Medina, Antonio & Triossi, Matteo, 2024. "Strategic priority-based course allocation," Journal of Economic Behavior & Organization, Elsevier, vol. 226(C).
  34. Sean Horan & Vikram Manjunath, 2022. "Lexicographic Composition of Choice Functions," Papers 2209.09293, arXiv.org.
  35. Nguyen, Thành & Peivandi, Ahmad & Vohra, Rakesh, 2016. "Assignment problems with complementarities," Journal of Economic Theory, Elsevier, vol. 165(C), pages 209-241.
  36. Masahiro KAWASAKI & Ryosuke SAKAI & Tomoya KAZUMURA, 2024. "Sequential dictatorship rules in multi-unit object assignment problems with money," Discussion papers e-23-007-v2, Graduate School of Economics , Kyoto University.
  37. Monte, Daniel & Tumennasan, Norovsambuu, 2015. "Centralized allocation in multiple markets," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 74-85.
  38. Jörgen Kratz, 2017. "Overlapping multiple object assignments," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(3), pages 723-753, March.
  39. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
  40. Eirinakis, Pavlos & Mourtos, Ioannis & Zampou, Eleni, 2022. "Random Serial Dictatorship for horizontal collaboration in logistics," Omega, Elsevier, vol. 111(C).
  41. Jacob Coreno & Ivan Balbuzanov, 2022. "Axiomatic Characterizations of Draft Rules," Papers 2204.08300, arXiv.org, revised May 2024.
  42. Monte, Daniel & Tumennasan, Norovsambuu, 2013. "Matching with quorums," Economics Letters, Elsevier, vol. 120(1), pages 14-17.
  43. Martin Bichler & Alexander Hammerl & Thayer Morrill & Stefan Waldherr, 2021. "How to Assign Scarce Resources Without Money: Designing Information Systems that are Efficient, Truthful, and (Pretty) Fair," Information Systems Research, INFORMS, vol. 32(2), pages 335-355, June.
  44. Kratz, Jörgen, 2014. "Overlapping Multiple Assignments," Working Papers 2014:44, Lund University, Department of Economics.
  45. Bettina Klaus & Alexandru Nichifor, 2020. "Serial dictatorship mechanisms with reservation prices," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(3), pages 665-684, October.
  46. Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
  47. Madhav Raghavan, 2017. "Serial Priority in Project Allocation: A Characterisation," Cahiers de Recherches Economiques du Département d'économie 17.17, Université de Lausanne, Faculté des HEC, Département d’économie.
  48. Shuhei Morimoto & Shigehiro Serizawa & Stephen Ching, 2013. "A characterization of the uniform rule with several commodities and agents," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(3), pages 871-911, March.
  49. Caspari, Gian, 2020. "Booster draft mechanism for multi-object assignment," ZEW Discussion Papers 20-074, ZEW - Leibniz Centre for European Economic Research.
  50. Han, Xiang, 2024. "A theory of fair random allocation under priorities," Theoretical Economics, Econometric Society, vol. 19(3), July.
  51. Fadaei, Salman & Bichler, Martin, 2017. "Truthfulness with value-maximizing bidders: On the limits of approximation in combinatorial markets," European Journal of Operational Research, Elsevier, vol. 260(2), pages 767-777.
  52. RAMAEKERS, Eve, 2010. "Fair allocation of indivisible goods among two agents," LIDAM Discussion Papers CORE 2010087, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  53. Franz Diebold & Haris Aziz & Martin Bichler & Florian Matthes & Alexander Schneider, 2014. "Course Allocation via Stable Matching," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 6(2), pages 97-110, April.
  54. Nhan-Tam Nguyen & Dorothea Baumeister & Jörg Rothe, 2018. "Strategy-proofness of scoring allocation correspondences for indivisible goods," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 50(1), pages 101-122, January.
  55. 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.
  56. Di Feng & Jacob Coreno, 2024. "Justified Fairness in House Allocation Problems: two Characterizations of Strategy-proof Mechanisms," Papers 2407.14101, arXiv.org.
  57. Manjunath, Vikram, 2012. "When too little is as good as nothing at all: Rationing a disposable good among satiable people with acceptance thresholds," Games and Economic Behavior, Elsevier, vol. 74(2), pages 576-587.
  58. Pinaki Mandal, 2022. "Simple dominance of fixed priority top trading cycles," Papers 2204.02154, arXiv.org, revised Feb 2023.
  59. Jiao, Zhenhua & Tian, Guoqiang, 2017. "The Blocking Lemma and strategy-proofness in many-to-many matchings," Games and Economic Behavior, Elsevier, vol. 102(C), pages 44-55.
  60. Antonio Romero‐Medina & Matteo Triossi, 2020. "Strategy‐proof and group strategy‐proof stable mechanisms: An equivalence," International Journal of Economic Theory, The International Society for Economic Theory, vol. 16(3), pages 349-354, September.
  61. Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
  62. Eric Budish & Judd B. Kessler, 2016. "Can Market Participants Report their Preferences Accurately (Enough)?," NBER Working Papers 22448, National Bureau of Economic Research, Inc.
  63. Hoda Atef Yekta & Robert Day, 2020. "Optimization-based Mechanisms for the Course Allocation Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 641-660, July.
  64. John Kennes Jr. & Daniel Monte Jr. & Norovsambuu Tumennasan Jr., 2014. "The Day Care Assignment: A Dynamic Matching Problem," American Economic Journal: Microeconomics, American Economic Association, vol. 6(4), pages 362-406, November.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.