Priority auctions and queue disciplines that depend on processing time
From MaRDI portal
Recommendations
- Pricing and priority auctions in queueing systems with a generalized delay cost structure
- Decentralized Regulation of a Queue
- Strategic arrivals to queues offering priority service
- Strategic bidding in a discrete accumulating priority queue
- Strategic bidding in an accumulating priority queue: equilibrium analysis
Cited in
(18)- Stable priority purchasing in queues
- On optimal mechanism design for a sequencing problem
- Online incentive-compatible mechanisms for traffic intersection auctions
- Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits
- An optimal mechanism charging for priority in a queue
- Strategic arrivals to queues offering priority service
- Strategic bidding in a discrete accumulating priority queue
- Pricing and priority auctions in queueing systems with a generalized delay cost structure
- An outlook on behavioural OR -- three tasks, three pitfalls, one definition
- A rescheduling and cost allocation mechanism for delayed arrivals
- Auctioning and selling positions: a non-cooperative approach to queueing conflicts
- Optimal search, learning and implementation
- When Fixed Price Meets Priority Auctions: Competing Firms with Different Pricing and Service Rules
- When queueing is better than push and shove
- The optimal admission threshold in observable queues with state dependent pricing
- Lottery rather than waiting-line auction
- Proportional scheduling, split-proofness, and merge-proofness
- Relative priority policies for minimizing the cost of queueing systems with service discrimination
This page was built for publication: Priority auctions and queue disciplines that depend on processing time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115447)
