Scheduling with opting out: Improving upon random priority

Operations Research

Volumn 49, Issue 4, 2001, Pages 565-577

  Crès, Hervé ^b   Moulin, Hervé ^b  

^a HEC PARIS   (France)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

OPERATIONS RESEARCH; PROBABILISTIC LOGICS; RANDOM PROCESSES;

RANDOM PRIORITY (RP) MECHANISMS;

SCHEDULING;

EID: 0034750687     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.49.4.565.11224     Document Type: Article

References (22)

1. Notes on strategyproof social choice functions
2. A simple random assignment problem with a unique solution
3. A new solution to the random assignment problem
4. Analysis and simulation of a fair queuing algorithm
5. Incentive mechanisms for priority queuing problems
6. The efficient allocation of individuals to positions
7. Sequencing and scheduling: Algorithms and complexity
8. Pricing computer services: Queuing effects
9. Optimal incentive compatible pricing for the M/M/1 queue
10. Procedural versus endstate justice: An implementation view point
11. The regulation of queue size by levying tolls
12. On packet switches with infinite storage
13. Making greed work in network: A game theoretic analysis of switch service discipline
14. On incentive compatibility and budget balancedness in public decision making
15. On a conjecture by Gale about one-sided matching problems