A simple random assignment problem with a unique solution

Cited In (45)

On slots' scheduling
Kidney exchange: an egalitarian mechanism
Probabilistic assignment of indivisible goods with single-peaked preferences
Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem
Pairwise kidney exchange
Incentives in social decision schemes with pairwise comparison preferences
Social Welfare in One-Sided Matching Markets without Money
Random aggregation without the Pareto principle
Ordinal efficiency and the polyhedral separating hyperplane theorem
A new solution to the random assignment problem.
Incentives in the probabilistic serial mechanism
Upper-contour strategy-proofness in the probabilistic assignment problem
A solution to the random assignment problem on the full preference domain
Ordinal Bayesian incentive compatibility in random assignment model
Overlapping multiple object assignments
Probabilistic assignment of objects: characterizing the serial rule
On two kinds of manipulation for school choice problems
Consistency in house allocation problems
Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object
Random assignments with uniform preferences: an impossibility result
An equilibrium analysis of the probabilistic serial mechanism
A note on the assignment problem with uniform preferences
Random assignment of multiple indivisible objects
House allocation with existing tenants
Consistency in the probabilistic assignment model
Conditions for incentive compatibility in models with multidimensional allocation functions and one-dimensional types
Arrays of distinct representatives --- a very simple NP-complete problem
Random scheduling with deadlines under dichotomous preferences
The \textit{ex ante} incentive compatible core of the assignment game.
Strategy-proofness and population-monotonicity for house allocation problems
Why do popular mechanisms lack efficiency in random environments?
On wastefulness of random assignments in discrete allocation problems
A two-objective fuzzy \(k\)-cardinality assignment problem
The probabilistic serial mechanism with private endowments
Assigning agents to a line
Ordinal efficiency and dominated sets of assignments.
Fair division of indivisible items among people with similar preferences
Random assignment under weak preferences
When is the probabilistic serial assignment uniquely efficient and envy-free?
Random assignments on preference domains with a tier structure
An alternative characterization of top trading cycles
The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods
Two simple variations of top trading cycles
Size versus fairness in the assignment problem
Age-based preferences in paired kidney exchange

   Recommendations

A new solution to the random assignment problem. 👍 👎
A solution to the random assignment problem on the full preference domain 👍 👎
A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism 👍 👎
Two axiomatic approaches to the probabilistic serial mechanism 👍 👎
A note on the assignment problem with uniform preferences 👍 👎

This page was built for publication: A simple random assignment problem with a unique solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q699028)