Efficient sequential assignment with incomplete information
From MaRDI portal
Publication:844917
DOI10.1016/j.geb.2009.06.005zbMath1197.90277OpenAlexW2041360143MaRDI QIDQ844917
Alex Gershkov, Benny Moldovanu
Publication date: 5 February 2010
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2009.06.005
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Discrete location and assignment (90B80) Economics of information (91B44)
Related Items (12)
Optimal market thickness ⋮ Price discrimination based on buyers' purchase history ⋮ Construction of Nash equilibrium in a game version of Elfving's multiple stopping problem ⋮ Ready to trade? On budget-balanced efficient trade with uncertain arrival ⋮ Revenue management by sequential screening ⋮ Generalized Sequential Stochastic Assignment Problem ⋮ Extensions of the sequential stochastic assignment problem ⋮ Optimal assignment of durable objects to successive agents ⋮ Multiagent Mechanism Design Without Money ⋮ Efficiency levels in sequential auctions with dynamic arrivals ⋮ Auctions with dynamic populations: efficiency and revenue maximization ⋮ Calendar mechanisms
Cites Work
- Unnamed Item
- Optimal search, learning and implementation
- Worst-case optimal redistribution of VCG payments in multi-unit auctions
- Stochastic orders
- Almost budget-balanced VCG mechanisms to assign multiple objects
- Convex functions, partial orderings, and statistical applications
- Optimal control of diffusion processes with reflection
- The effect of false-name bids in combinatorial auctions: new fraud in internet auctions.
- Non-Bayesian optimal search and dynamic implementation
- Optimal Sequential Assignments with Random Arrival Times
- An Efficient Dynamic Mechanism
- A persistency problem connected with a point process
- A Sequential Stochastic Assignment Problem
- Stochastic orders and majorization of mean order statistics
This page was built for publication: Efficient sequential assignment with incomplete information
