Constrained random matching
From MaRDI portal
Publication:2155237
DOI10.1016/j.jet.2022.105472zbMath1497.91199OpenAlexW4225288475MaRDI QIDQ2155237
Publication date: 15 July 2022
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jet.2022.105472
Related Items
The vigilant eating rule: a general approach for probabilistic economic design with constraints ⋮ Axiomatic characterizations of the constrained probabilistic serial mechanism ⋮ A simple characterization of assignment mechanisms on set constraints ⋮ Simultaneous eating algorithm and greedy algorithm in assignment problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex strategyproofness with an application to the probabilistic serial mechanism
- Assignment problems with complementarities
- School choice with controlled choice constraints: hard bounds versus soft bounds
- Probabilistic assignment of objects: characterizing the serial rule
- Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
- A characterization of the extended serial correspondence
- Stability concepts in matching under distributional constraints
- Age-based preferences in paired kidney exchange
- House allocation with fractional endowments
- Transplant quality and patients' preferences in paired kidney exchange
- Pairwise kidney exchange
- Incentives in the probabilistic serial mechanism
- A solution to the random assignment problem on the full preference domain
- Random assignment: redefining the serial rule
- Decomposing random mechanisms
- The probabilistic serial mechanism with private endowments
- Random assignment of multiple indivisible objects
- Random assignment under weak preferences
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- How good are convex hull algorithms?
- Fairness and efficiency for allocations with participation constraints
- Short trading cycles: paired kidney exchange with strict ordinal preferences
- Incentive compatibility and feasibility constraints in housing markets
- The extended serial correspondence on a rich preference domain
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- Approximate Random Allocation Mechanisms
- The quickhull algorithm for convex hulls
- Effective affirmative action in school choice
- Two axiomatic approaches to the probabilistic serial mechanism
- A theory of school-choice lotteries
- Maximum matching and a polyhedron with 0,1-vertices
- The maximum numbers of faces of a convex polytope
- College Admissions and the Stability of Marriage
- A new solution to the random assignment problem.
This page was built for publication: Constrained random matching
