Abstract
First and second price auctions are optimal mechanisms for resource allocation in many situations and are used widely. However, unlike the static once-and-for-all situations for which auctions are efficient, in dynamic stochastic environments these standard auctions cannot necessarily support optimal allocations. The potential inefficiency of auctions is demonstrated by example. A computer server is modeled as a non-interruptible M/M/1 system, with heterogeneous users. The optimal allocation of jobs is derived, and it is shown that this allocation cannot be supported as either a first-price or a second-price auction equilibrium.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
