Pages that link to "Item:Q1786741"
From MaRDI portal
The following pages link to Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences (Q1786741):
Displaying 10 items.
- Why do popular mechanisms lack efficiency in random environments? (Q840694) (← links)
- A solution to the random assignment problem on the full preference domain (Q860356) (← links)
- Partial strategyproofness: relaxing strategyproofness for the random assignment problem (Q1995295) (← links)
- Extended random assignment mechanisms on a family of good sets (Q2241324) (← links)
- The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching (Q2291153) (← links)
- The incompatibility of Pareto optimality and dominant-strategy incentive compatibility in sufficiently-anonymous budget-constrained quasilinear settings (Q2351253) (← links)
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines (Q2353644) (← links)
- An incompatibility between recursive unanimity and strategy-proofness in two-sided matching problems (Q2452262) (← links)
- Random assignments with uniform preferences: an impossibility result (Q6106541) (← links)
- A new impossibility result for random assignments (Q6170029) (← links)
