Priority Auctions and Queue Disciplines That Depend on Processing Time
From MaRDI portal
Publication:3115447
DOI10.1287/mnsc.1040.0301zbMath1232.90151OpenAlexW1985655142MaRDI QIDQ3115447
Benny Moldovanu, Thomas Kittsteiner
Publication date: 21 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://epub.ub.uni-muenchen.de/13541/
Queues and service in operations research (90B22) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (11)
An outlook on behavioural OR -- three tasks, three pitfalls, one definition ⋮ A rescheduling and cost allocation mechanism for delayed arrivals ⋮ Optimal search, learning and implementation ⋮ When Fixed Price Meets Priority Auctions: Competing Firms with Different Pricing and Service Rules ⋮ Proportional scheduling, split-proofness, and merge-proofness ⋮ THE OPTIMAL ADMISSION THRESHOLD IN OBSERVABLE QUEUES WITH STATE DEPENDENT PRICING ⋮ Relative priority policies for minimizing the cost of queueing systems with service discrimination ⋮ On optimal mechanism design for a sequencing problem ⋮ Strategic arrivals to queues offering priority service ⋮ Online incentive-compatible mechanisms for traffic intersection auctions ⋮ Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits
This page was built for publication: Priority Auctions and Queue Disciplines That Depend on Processing Time
