Using Bids, Arguments and Preferences in Sensitive Multi-unit Assignments: A p-Equitable Process and a Course Allocation Case Study
Author
Abstract
Suggested Citation
DOI: 10.1007/s10726-016-9483-9
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Lars Ehlers & Bettina Klaus, 2003. "Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(2), pages 265-280, October.
- Atila Abdulkadiroğlu & Parag A. Pathak & Alvin E. Roth, 2005.
"The New York City High School Match,"
American Economic Review, American Economic Association, vol. 95(2), pages 364-367, May.
- Pathak, Parag A. & Abdulkadiroglu, Atila & Roth, Alvin, 2005. "The New York City High School Match," Scholarly Articles 2562765, Harvard University Department of Economics.
- 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.
- Eric Budish & Estelle Cantillon, 2009. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," Working Papers ECARES 2010-02, ULB -- Universite Libre de Bruxelles.
- Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," ULB Institutional Repository 2013/99376, ULB -- Universite Libre de Bruxelles.
- Cantillon, Estelle & Budish, Eric, 2010. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," CEPR Discussion Papers 7641, C.E.P.R. Discussion Papers.
- Holmvall, Camilla M. & Bobocel, D. Ramona, 2008. "What fair procedures say about me: Self-construals and reactions to procedural fairness," Organizational Behavior and Human Decision Processes, Elsevier, vol. 105(2), pages 147-168, March.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- 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.
- Scott Kominers & Alexander Teytelboym & Vincent Crawford, 2017. "An Invitation to Market Design," Working Papers 2017-069, Human Capital and Economic Opportunity Working Group.
- Kominers, Scott Duke & Teytelboym, Alexander & Crawford, Vincent P, 2017. "An invitation to market design," University of California at San Diego, Economics Working Paper Series qt3xp2110t, Department of Economics, UC San Diego.
- Pamela Giustinelli & Charles F. Manski, 2018. "Survey Measures Of Family Decision Processes For Econometric Analysis Of Schooling Decisions," Economic Inquiry, Western Economic Association International, vol. 56(1), pages 81-99, January.
- Romero-Medina, Antonio & Triossi, Matteo, 2024.
"Strategic priority-based course allocation,"
Journal of Economic Behavior & Organization, Elsevier, vol. 226(C).
- Antonio Romero-Medina & Matteo Triossi, 2022. "Strategic Priority-Based Course Allocation," Working Papers 13, Venice School of Management - Department of Management, Università Ca' Foscari Venezia.
- Monte, Daniel & Tumennasan, Norovsambuu, 2015.
"Centralized allocation in multiple markets,"
Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 74-85.
- Daniel Monte & Norovsambuu Tumennasan, 2012. "Centralized Allocation in Multiple Markets," Economics Working Papers 2012-09, Department of Economics and Business Economics, Aarhus University.
- Monte, Daniel & Tumennasan, Norovsambuu, 2013. "Centralized allocation in multiple markets," Textos para discussão 322, FGV EESP - Escola de Economia de São Paulo, Fundação Getulio Vargas (Brazil).
- Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
- Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
- 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.
- Eric Budish & Estelle Cantillon, 2009. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," Working Papers ECARES 2010-02, ULB -- Universite Libre de Bruxelles.
- Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," ULB Institutional Repository 2013/99376, ULB -- Universite Libre de Bruxelles.
- Cantillon, Estelle & Budish, Eric, 2010. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," CEPR Discussion Papers 7641, C.E.P.R. Discussion Papers.
- 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.
- John William Hatfield & Fuhito Kojima & Yusuke Narita, 2011.
"Promoting School Competition Through School Choice: A Market Design Approach,"
Working Papers
2011-018, Human Capital and Economic Opportunity Working Group.
- John Hatfield & Fuhito Kojima & Yusuke Narita, 2012. "Promoting School Competition Through School Choice: A Market Design Approach," Discussion Papers 12-019, Stanford Institute for Economic Policy Research.
- John William Hatfield & Fuhito Kojima & Yusuke Narita, 2012. "Promoting School Competition Through School Choice: A Market Design Approach," Discussion Papers 12-036, Stanford Institute for Economic Policy Research.
- 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.
- Romero-Medina, Antonio & Triossi, Matteo, 2017. "Two-sided strategy-proofness in many-to-many matching markets," UC3M Working papers. Economics 26081, Universidad Carlos III de Madrid. Departamento de EconomÃa.
- 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.
- Szilvia Pápai & Péter Biró & Flip Klijn, 2021. "Serial Rules in a Multi-Unit Shapley-Scarf Market," Working Papers 1255, Barcelona School of Economics.
- 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.
- Nguyen, Thành & Peivandi, Ahmad & Vohra, Rakesh, 2016. "Assignment problems with complementarities," Journal of Economic Theory, Elsevier, vol. 165(C), pages 209-241.
- Tayfun Sönmez, 2013.
"Bidding for Army Career Specialties: Improving the ROTC Branching Mechanism,"
Journal of Political Economy, University of Chicago Press, vol. 121(1), pages 186-219.
- Tayfun Sönmez, 2011. "Bidding for Army Career Specialties: Improving the ROTC Branching Mechanism," Boston College Working Papers in Economics 783, Boston College Department of Economics.
- Eric Budish & Judd B. Kessler, 2016. "Can Market Participants Report their Preferences Accurately (Enough)?," NBER Working Papers 22448, National Bureau of Economic Research, Inc.
- 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.
- Eirinakis, Pavlos & Mourtos, Ioannis & Zampou, Eleni, 2022. "Random Serial Dictatorship for horizontal collaboration in logistics," Omega, Elsevier, vol. 111(C).
- Caspari, Gian, 2020. "Booster draft mechanism for multi-object assignment," ZEW Discussion Papers 20-074, ZEW - Leibniz Centre for European Economic Research.
- 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.
- Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
More about this item
Keywords
Group decision support; ThinkLet; Formal concept analysis; Logical information systems;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:grdene:v:25:y:2016:i:6:d:10.1007_s10726-016-9483-9. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.