Pages that link to "Item:Q3115447"
From MaRDI portal
The following pages link to Priority Auctions and Queue Disciplines That Depend on Processing Time (Q3115447):
Displaying 17 items.
- An outlook on behavioural OR -- three tasks, three pitfalls, one definition (Q321044) (← links)
- A rescheduling and cost allocation mechanism for delayed arrivals (Q342157) (← links)
- Auctioning and selling positions: a non-cooperative approach to queueing conflicts (Q406371) (← links)
- Optimal search, learning and implementation (Q417605) (← links)
- When queueing is better than push and shove (Q532746) (← links)
- Lottery rather than waiting-line auction (Q862544) (← links)
- Proportional scheduling, split-proofness, and merge-proofness (Q932808) (← links)
- Relative priority policies for minimizing the cost of queueing systems with service discrimination (Q965531) (← links)
- Stable priority purchasing in queues (Q1082722) (← links)
- On optimal mechanism design for a sequencing problem (Q2018936) (← links)
- Online incentive-compatible mechanisms for traffic intersection auctions (Q2030521) (← links)
- Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits (Q2115771) (← links)
- Strategic arrivals to queues offering priority service (Q2281371) (← links)
- Strategic bidding in a discrete accumulating priority queue (Q2294291) (← links)
- Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure (Q3114907) (← links)
- When Fixed Price Meets Priority Auctions: Competing Firms with Different Pricing and Service Rules (Q5113891) (← links)
- THE OPTIMAL ADMISSION THRESHOLD IN OBSERVABLE QUEUES WITH STATE DEPENDENT PRICING (Q5413457) (← links)
