Random Matching under Dichotomous Preferences

268 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Matching, Allocation, and Exchange of Discrete Resources (2009, unknown): “The related literature for this subsection include two other papers, one by Bogomolnaia and Moulin (2004), who inspected a two-sided matching problem with the same setup as the model above, and one by Dutta and Ray (1989), who introduced the egalitarian approach for convex TU-cooperative games.”
Almost Envy-Freeness with General Valuations (2017, methodology): “, [2, 9]), but this is not suitable for the applications we are most interested in, where the outcome is only used once.”
The Unreasonable Fairness of Maximum Nash Welfare (2016, unknown): “Second, it is possible to allow randomized allocations [Bogomolnaia and Moulin 2001, 2004; Budish et al. 2013]; this is hardly appropriate for the cases we find on Spliddit in which the outcome is used only once.”
When Are Local Incentive Constraints Sufficient (2012, background): “Bogomolnaia, Moulin, and Stong [11] thoroughly explore the general social choice problem with dichotomous preferences; matching mechanisms for dichotomous preferences are studied by Bogomolnaia and Moulin [10] and Roth, Sönmez, and Ünver [34].”
Pairwise kidney exchange (2005, unknown): “The constrained exchange problem studied in the present paper is closely related to elegant results from graph theory, which will prove very useful, in ways recently pioneered by Bogomolnaia and Moulin [12].”