An equilibrium analysis of the probabilistic serial mechanism
From MaRDI portal
Recommendations
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- A new solution to the random assignment problem.
- Incentives in the probabilistic serial mechanism
- Two axiomatic approaches to the probabilistic serial mechanism
- An experimental study on the incentives of the probabilistic serial mechanism
Cites work
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- A constructive proof of the ordinal efficiency welfare theorem
- A new solution to the random assignment problem.
- A simple random assignment problem with a unique solution
- A solution to the random assignment problem on the full preference domain
- A theory of school-choice lotteries
- An experimental study on the incentives of the probabilistic serial mechanism
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- House allocation with existing tenants
- Implementation in stochastic dominance Nash equilibria
- Incentives in the probabilistic serial mechanism
- Incomplete information and singleton cores in matching markets
- Kidney Exchange
- Ordinal efficiency and the polyhedral separating hyperplane theorem
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Random assignment of multiple indivisible objects
- Scheduling with Opting Out: Improving upon Random Priority
- The probabilistic serial mechanism with private endowments
- Why do popular mechanisms lack efficiency in random environments?
Cited in
(15)- An experimental study on the incentives of the probabilistic serial mechanism
- Game-theoretically secure protocols for the ordinal random assignment problem
- Scheduling with Opting Out: Improving upon Random Priority
- A new solution to the random assignment problem.
- The price of anarchy of probabilistic serial in one-sided allocation problems
- Incentives in the probabilistic serial mechanism
- Bounded incentives in manipulating the probabilistic serial rule
- Submodular optimization views on the random assignment problem
- Stability and the immediate acceptance rule when school priorities are weak
- Competitive equilibrium in the random assignment problem
- Two axiomatic approaches to the probabilistic serial mechanism
- Approximate random allocation mechanisms
- Partial strategyproofness: relaxing strategyproofness for the random assignment problem
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences
This page was built for publication: An equilibrium analysis of the probabilistic serial mechanism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328558)