Pages that link to "Item:Q699028"
From MaRDI portal
The following pages link to A simple random assignment problem with a unique solution (Q699028):
Displaying 26 items.
- An equilibrium analysis of the probabilistic serial mechanism (Q328558) (← links)
- An alternative characterization of top trading cycles (Q372362) (← links)
- Random aggregation without the Pareto principle (Q427548) (← links)
- The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods (Q431227) (← links)
- Probabilistic assignment of objects: characterizing the serial rule (Q449195) (← links)
- Assigning agents to a line (Q485809) (← links)
- Two simple variations of top trading cycles (Q496872) (← links)
- When is the probabilistic serial assignment uniquely efficient and envy-free? (Q504391) (← links)
- Age-based preferences in paired kidney exchange (Q523519) (← links)
- Kidney exchange: an egalitarian mechanism (Q533096) (← links)
- Ordinal efficiency and the polyhedral separating hyperplane theorem (Q697847) (← links)
- Consistency in the probabilistic assignment model (Q705901) (← links)
- Pairwise kidney exchange (Q813943) (← links)
- Why do popular mechanisms lack efficiency in random environments? (Q840694) (← links)
- Incentives in the probabilistic serial mechanism (Q848608) (← links)
- A solution to the random assignment problem on the full preference domain (Q860356) (← links)
- Random scheduling with deadlines under dichotomous preferences (Q898667) (← links)
- The probabilistic serial mechanism with private endowments (Q980972) (← links)
- Random assignment of multiple indivisible objects (Q1005770) (← links)
- Random assignment under weak preferences (Q1021614) (← links)
- Ordinal efficiency and dominated sets of assignments. (Q1411037) (← links)
- The \textit{ex ante} incentive compatible core of the assignment game. (Q1431786) (← links)
- Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object (Q1680102) (← links)
- On two kinds of manipulation for school choice problems (Q1762420) (← links)
- A note on the assignment problem with uniform preferences (Q1785360) (← links)
- A new solution to the random assignment problem. (Q5958895) (← links)
