How to Assign Scarce Resources Without Money: Designing Information Systems that are Efficient, Truthful, and (Pretty) Fair
Published Online:15 Feb 2021https://doi.org/10.1287/isre.2020.0959
References
- (2017) Minimizing justified envy in school choice: The design of New Orleans’ oneapp. NBER Working Paper No. 23265, National Bureau of Economic Research, Cambridge, MA.Google Scholar
- (2003) School choice: A mechanism design approach. Amer. Econom. Rev. 93(3):729–747.Crossref, Google Scholar
- (2013) Impact of information feedback in continuous combinatorial auctions: An experimental study of economic performance. MIS Quart. 37(1):55–76.Crossref, Google Scholar
- (2005) Toward comprehensive real-time bidder support in iterative combinatorial auctions. Inform. Systems Res. 16(2):169–185.Link, Google Scholar
- (2001) Research commentary: Introducing a third dimension in information systems design–the case for incentive alignment. Inform. Systems Res. 12(3):225–239.Link, Google Scholar
- (1999) A tale of two mechanisms: Student placement. J. Econom. Theory 84(1):73–94.Crossref, Google Scholar
- (2004) 50th Anniversary article: The evolution of research on information systems: A fiftieth-year survey of the literature in management science. Management Sci. 50(3):281–298.Google Scholar
- (2009) Overlapping online auctions: Empirical characterization of bidder strategies and auction prices. MIS Quart. 33(4):763–783.Crossref, Google Scholar
- (2003) Replicating online Yankee auctions to analyze auctioneers’ and bidders’ strategies. Inform. Systems Res. 14(3):244–268.Link, Google Scholar
- (2010) Research commentary–designing smart markets. Inform. Systems Res. 21(4):688–699.Link, Google Scholar
- (2017) Coalition-based pricing in ascending combinatorial auctions. Inform. Systems Res. 28(1):159–179.Link, Google Scholar
- (2008) Student admissions in Hungary as Gale and Shapley envisaged. Technical Report TR-2008-291, University of Glasgow, Glasgow, Scotland.Google Scholar
- ( 2017) Applications of matching models under preferences. Endriss U, ed. Trends in Computational Social Choice (AI Access, El Segundo, CA), 345–373.Google Scholar
- (2016) Course match: A large-scale implementation of approximate competitive equilibrium from equal incomes for combinatorial allocation. Oper. Res. 65(2):314–336.Link, Google Scholar
- (2012) The multi-unit assignment problem: Theory and evidence from course allocation at Harvard. Amer. Econom. Rev. 102(5):2237–2271.Crossref, Google Scholar
- (2016) Refugee resettlement. Working paper, University of Oxford, Oxford, UK.Google Scholar
- (2014) Course allocation via stable matching. Bus. Inform. Systems Engrg. 6(2):97–110.Google Scholar
- (2017) Matching with indifferences: A comparison of algorithms in the context of course allocation. Eur. J. Oper. Res. 260(1):268–282.Crossref, Google Scholar
- (2012) A characterization of the top trading cycles mechanism in the school choice problem. Preprint, submitted September 16, https://ssrn.com/abstract=2147449.Google Scholar
- (2003) Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems. Soc. Choice Welfare 21(2):265–280.Crossref, Google Scholar
- (2014) School choice with controlled choice constraints: Hard bounds vs. soft bounds. J. Econom. Theory 153:648–683.Crossref, Google Scholar
- (2003) Decentralized mechanism design for supply chain organizations using an auction market. Inform. Systems Res. 14(1):1–22.Link, Google Scholar
- (2016) Strategyproof matching with minimum quotas. ACM Trans. Econom. Comput. 4(1):1–40.Google Scholar
- (1962) College admissions and the stability of marriage. Amer. Math. Monthly 69(1):9–15.Crossref, Google Scholar
- (2013) Positioning and presenting design science research for maximum impact. MIS Quart. 37(2):337–355.Crossref, Google Scholar
- (2018) The equitable top trading cycles mechanism for school choice. Internat. Econom. Rev. 59(4):2219–2258.Crossref, Google Scholar
- (2007) A three cycle view of design science research. Scandinavian J. Inform. Systems 19(2):87–92.Google Scholar
- (2010) Design science research in information systems. Design Research in Information Systems, Integrated Series in Information Systems, vol. 22 (Springer, New York), 9–22.Google Scholar
- (2004) Design science in information systems research. MIS Quart. 28(1):75–105.Crossref, Google Scholar
- (2006) The limits of ex post implementation. Econometrica 74(3):585–610.Crossref, Google Scholar
- (2015) Efficient matching under distributional constraints: Theory and applications. Amer. Econom. Rev. 105(1):67–99.Crossref, Google Scholar
- (2020) Non-monetary coordination mechanisms for time slot allocation in warehouse delivery. Eur. J. Oper. Res. 286(3):897–907.Crossref, Google Scholar
- (2010) Ex ante information and the design of keyword auctions. Inform. Systems Res. 21(1):133–153.Google Scholar
- (2016) Exploring bidder heterogeneity in multichannel sequential B2B auctions. MIS Quart. 40(3):645–662.Crossref, Google Scholar
- (2017) Information transparency in B2B auction markets: The role of winner identity disclosure. Preprint, submitted April 11, https://ssrn.com/abstract=2949785.Google Scholar
- (1994) Strategy-proofness and the strict core in a market with indivisibilities. Internat. J. Game Theory 23(1):75–83.Crossref, Google Scholar
- (2013) An alternative characterization of top trading cycles. Econom. Theory 54(1):181–197.Crossref, Google Scholar
- (2015a) Making just school assignments. Games Econom. Behav. 92:18–27.Crossref, Google Scholar
- (2015b) Two simple variations of top trading cycles. Econom. Theory 60(1):123–140.Crossref, Google Scholar
- (2016) Assignment problems with complementarities. J. Econom. Theory 165:209–241.Crossref, Google Scholar
- NRMP (2014) National Resident Matching Program. Accessed August 19, 2020, http://www.nrmp.org.Google Scholar
- (2000) Strategyproof assignment by hierarchical exchange. Econometrica 68(6):1403–1433.Crossref, Google Scholar
- (2001) Strategyproof and nonbossy multiple assignments. J. Public Econom. Theory 3(3):257–271.Crossref, Google Scholar
- (2017) Incentive compatible allocation and exchange of discrete resources. Theoret. Econom. 12(1):287–329.Crossref, Google Scholar
- (1982) Incentive compatibility in a market with indivisible goods. Econom. Lett. 9(2):127–132.Crossref, Google Scholar
- (2002) The economist as engineer: Game theory, experimentation, and computation as tools for design economics. Econometrica 70(4):1341–1378.Crossref, Google Scholar
- (1974) On cores and indivisibility. J. Math. Econom. 1(1):23–37.Crossref, Google Scholar
- (2013) Matching with (branch-of-choice) contracts at the United States Military Academy. Econometrica 81(2):451–488.Crossref, Google Scholar
- (2019) Affirmative action in India via vertical and horizontal reservations. Working paper, Boston College, Boston.Google Scholar
- (2003) A general strategy proof fair allocation mechanism. Econom. Lett. 81(1):73–79.Crossref, Google Scholar

