Random Matching Under Dichotomous Preferences
From MaRDI portal
Publication:5473013
DOI10.1111/j.1468-0262.2004.00483.xzbMath1142.91691OpenAlexW2063341202MaRDI QIDQ5473013
Anna Bogomolnaia, Hervé Moulin
Publication date: 19 June 2006
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: http://www.ruf.rice.edu/~econ/papers/2001papers/03Moulin.pdf
Related Items
The replacement principle in networked economies with single-peaked preferences ⋮ A graph theoretic approach to the slot allocation problem ⋮ Truthful fair division without free disposal ⋮ Pareto Optimal Matchings in Many-to-Many Markets with Ties ⋮ Power set extensions of dichotomous preferences ⋮ Strategy-proof assignment on the full preference domain ⋮ On the tradeoff between efficiency and strategyproofness ⋮ A solution to the random assignment problem on the full preference domain ⋮ Two-sided matching with indifferences ⋮ A one-sided many-to-many matching problem ⋮ Multi-unit assignment under dichotomous preferences ⋮ The decomposition of strategy-proof random social choice functions on dichotomous domains ⋮ Price competition between random and assortive matchmakers ⋮ Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object ⋮ Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems ⋮ Computing fair and efficient allocations with few utility values ⋮ The vigilant eating rule: a general approach for probabilistic economic design with constraints ⋮ Strategy-proof stochastic assignment ⋮ On reachable assignments under dichotomous preferences ⋮ Altruistically unbalanced kidney exchange ⋮ Ordinal approximation for social choice, matching, and facility location problems given candidate positions ⋮ Almost Envy-Freeness with General Valuations ⋮ Random assignment: redefining the serial rule ⋮ Random scheduling with deadlines under dichotomous preferences ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ Stable matching with multilayer approval preferences: approvals can be harder than strict preferences ⋮ On existence of truthful fair cake cutting mechanisms ⋮ A planner-optimal matching mechanism and its incentive compatibility in a restricted domain ⋮ Random aggregation without the Pareto principle ⋮ Fair-by-design matching ⋮ Allocating chances of success in finite and infinite societies: the utilitarian criterion ⋮ Assigning papers to referees ⋮ Kidney exchange: further utilization of donors via listed exchange ⋮ Subjective homophily and the fixtures problem ⋮ Assigning agents to a line ⋮ Bargaining and efficiency in networks ⋮ The price of fairness for indivisible goods ⋮ A computational approach to modeling commodity markets ⋮ Stable fractional matchings ⋮ Size versus truncation robustness in the assignment problem ⋮ Pareto optimal matchings in many-to-many markets with ties ⋮ Extended random assignment mechanisms on a family of good sets ⋮ Minimal envy and popular matchings ⋮ Fractional matching markets ⋮ Fair and group strategy-proof good allocation with money ⋮ Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity ⋮ Egalitarian equivalence and strategyproofness in the queueing problem ⋮ The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences ⋮ Endogenous formation of networks for local public goods ⋮ Kidney exchange: an egalitarian mechanism ⋮ Compromises and rewards: stable and non-manipulable probabilistic matching ⋮ Group strategyproofness in queueing models ⋮ Popular mixed matchings ⋮ Collective choice under dichotomous preferences ⋮ Collectively rational voting rules for simple preferences ⋮ Strategy-proof exchange under trichotomous preferences ⋮ Computing fair and efficient allocations with few utility values ⋮ Efficiency and stability of probabilistic assignments in marriage problems ⋮ The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching ⋮ Strategy-proof group selection under single-peaked preferences over group size ⋮ Random assignment under weak preferences ⋮ Kidney exchange with immunosuppressants ⋮ Stable matchings in the marriage model with indifferences ⋮ Collective Choice for Simple Preferences ⋮ Closing Gaps in Asymptotic Fair Division ⋮ Size versus truthfulness in the house allocation problem ⋮ Submodular optimization views on the random assignment problem ⋮ Matching with partners and projects ⋮ Group strategy-proof probabilistic voting with single-peaked preferences ⋮ Approval voting under dichotomous preferences: a catalogue of characterizations ⋮ Structured preferences: a literature survey ⋮ Priority matchings revisited ⋮ Pairwise kidney exchange
