Pages that link to "Item:Q840694"
From MaRDI portal
The following pages link to Why do popular mechanisms lack efficiency in random environments? (Q840694):
Displaying 22 items.
- An equilibrium analysis of the probabilistic serial mechanism (Q328558) (← links)
- The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods (Q431227) (← links)
- An experimental study on the incentives of the probabilistic serial mechanism (Q485790) (← links)
- Assigning agents to a line (Q485809) (← links)
- When is the probabilistic serial assignment uniquely efficient and envy-free? (Q504391) (← links)
- Efficiency under a combination of ordinal and cardinal information on preferences (Q553528) (← links)
- Incentives in the probabilistic serial mechanism (Q848608) (← links)
- The probabilistic serial mechanism with private endowments (Q980972) (← links)
- Fair solutions to the random assignment problem (Q1633672) (← links)
- Probabilistic assignment: an extension approach (Q1649093) (← links)
- Compromises and rewards: stable and non-manipulable probabilistic matching (Q2002058) (← links)
- Trading probabilities along cycles (Q2138374) (← links)
- Random assignments on sequentially dichotomous domains (Q2173423) (← links)
- Efficient rules for probabilistic assignment (Q2338661) (← links)
- Random assignments on preference domains with a tier structure (Q2338670) (← links)
- Fairness and efficiency in strategy-proof object allocation mechanisms (Q2359384) (← links)
- Efficient lottery design (Q2362194) (← links)
- The ``Boston'' school-choice mechanism: an axiomatic approach (Q2447152) (← links)
- Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
- Strategy-proof and envy-free mechanisms for house allocation (Q6090447) (← links)
- Bounded incentives in manipulating the probabilistic serial rule (Q6142601) (← links)
- A theory of fair random allocation under priorities (Q6631809) (← links)