Random Matching Under Dichotomous Preferences
From MaRDI portal
Recommendations
- Rerandomization and optimal matching
- A model of random matching
- A random matching theory
- Random stable matchings
- Stable matching with uncertain pairwise preferences
- Random matching under priorities: stability and no envy concepts
- Random popular matchings with incomplete preference lists
- Random popular matchings with incomplete preference lists
- Stable matchings and preferences of couples
Cited in
(only showing first 100 items - show all)- Random assignment under weak preferences
- On the tradeoff between efficiency and strategyproofness
- Towards a fair distribution mechanism for asylum
- 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
- A marriage matching mechanism menagerie
- On randomized matching mechanisms
- Assigning papers to referees
- Size versus truncation robustness in the assignment problem
- Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity
- Compromises and rewards: stable and non-manipulable probabilistic matching
- Strategy-proof exchange under trichotomous preferences
- Kidney exchange with immunosuppressants
- Stable matchings in the marriage model with indifferences
- Group strategy-proof probabilistic voting with single-peaked preferences
- Approval voting under dichotomous preferences: a catalogue of characterizations
- Structured preferences: a literature survey
- Constrained random matching
- Multi-unit assignment under dichotomous preferences
- Matching through institutions
- Ordinal approximation for social choice, matching, and facility location problems given candidate positions
- Fair-by-design matching
- Subjective homophily and the fixtures problem
- The price of fairness for indivisible goods
- Stable fractional matchings
- Extended random assignment mechanisms on a family of good sets
- Minimal envy and popular matchings
- Fair and group strategy-proof good allocation with money
- Egalitarian equivalence and strategyproofness in the queueing problem
- 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
- Size versus truthfulness in the house allocation problem
- Random matching under priorities: stability and no envy concepts
- Submodular optimization views on the random assignment problem
- Matching with partners and projects
- Priority matchings revisited
- The replacement principle in networked economies with single-peaked preferences
- A graph theoretic approach to the slot allocation problem
- A random matching theory
- Corrigendum to ``On randomized matching mechanisms [Econ. Theory 8 (1996) 377--381]
- Strategy-proof assignment on the full preference domain
- Two-sided matching with indifferences
- A one-sided many-to-many matching problem
- Kidney exchange: further utilization of donors via listed exchange
- A computational approach to modeling commodity markets
- Random matching in the college admissions problem
- Collective choice under dichotomous preferences
- Computing fair and efficient allocations with few utility values
- The vigilant eating rule: a general approach for probabilistic economic design with constraints
- Collective Choice for Simple Preferences
- Power set extensions of dichotomous preferences
- Employment by lotto revisited
- Pareto optimal matchings in many-to-many markets with ties
- Strategy-proof stochastic assignment
- Altruistically unbalanced kidney exchange
- Random aggregation without the Pareto principle
- Allocating chances of success in finite and infinite societies: the utilitarian criterion
- Matching markets with mixed ownership: the case for a real-life assignment mechanism
- Assigning agents to a line
- Closing gaps in asymptotic fair division
- Pareto optimal matchings in many-to-many markets with ties
- Almost envy-freeness with general valuations
- Random serial dictatorship: the one and only
- Fractional matching markets
- Endogenous formation of networks for local public goods
- Kidney exchange: an egalitarian mechanism
- Group strategyproofness in queueing models
- Popular mixed matchings
- Collectively rational voting rules for simple preferences
- Efficiency and stability of probabilistic assignments in marriage problems
- On reachable assignments under dichotomous preferences
- Distance on matchings: An axiomatic approach
- Fair division of indivisible goods: recent progress and open questions
- Computing fair and efficient allocations with few utility values
- On existence of truthful fair cake cutting mechanisms
- A planner-optimal matching mechanism and its incentive compatibility in a restricted domain
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
- A fair and truthful mechanism with limited subsidy
- Computational complexity of \(k\)-stable matchings
- Top trading cycles
- Rawlsian matching
- Achieving the maximum size for exchange problems with dichotomous preferences
- Bargaining and efficiency in networks
- Communication complexity of discrete fair division
- Stable allocations in discrete exchange economies
- Settling the score: portioning with cardinal preferences
- Stable matching with approval preferences under partial information
- Coordinating charitable donations with Leontief preferences
- Minimizing blocking agents for stable matching with partial approval information
- The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences
- Egalitarian random assignment
- Fair integer programming under dichotomous and cardinal preferences
- On the existence of EFX (and Pareto-optimal) allocations for binary chores
- On the existence of EFX (and Pareto-optimal) allocations for binary chores
- Computational complexity of the Hylland-Zeckhauser mechanism for one-sided matching markets
- Truthful cake sharing
- Proportional representation in matching markets: selecting multiple matchings under dichotomous preferences
- Computational complexity of the Hylland-Zeckhauser scheme for one-sided matching markets
This page was built for publication: Random Matching Under Dichotomous Preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5473013)
