Efficient and Competitive Rationing
From MaRDI portal
Recommendations
Cited in
(17)- Competition among sellers who offer auctions instead of prices
- The optimal mechanism for selling to a budget-constrained buyer
- Optimal priority pricing by a durable goods monopolist
- Mechanism design with a restricted action space
- Nonlinear pricing with finite information
- Communication and efficiency in auctions
- The choice of the number of varieties: justifying simple mechanisms
- Priority Rules and Other Asymmetric Rationing Methods
- Generalized coarse matching
- Rationing, Queues, and Black Markets
- Coarse matching with incomplete information
- Limits of exact equilibria for capacity constrained sellers with costly search.
- Assortative matching by lottery contests
- Generalized welfare lower bounds and strategyproofness in sequencing problems
- Pareto improvements in the contest for college admissions
- Priority search with outside options
- Optimal sales to users who hold inventory
This page was built for publication: Efficient and Competitive Rationing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818773)