Scheduling with Opting Out: Improving upon Random Priority

References

• Baiou M., Balinski M.Polytopes of truncated permutations: a conjecture (1998) . Mimeo, Laboratoire d'Économétrie, École Polytechnique, ParisGoogle Scholar
• Barbera S., Arrow K., Sen A., Suzumura K. Notes on strategyproof social choice functions. Social Choice Reexamined (1995) (Macmillan, London) Google Scholar
• Bazaraa M., Jarvia J., Sherali H.Linear Programming in Network Flows (1990) 2nd ed.(Wiley, New York) Google Scholar
• Bogomolnaia A., Moulin H. A simple random assignment problem with a unique solution. Economic Theory (2001a) . forthcomingCrossref, Google Scholar
• Bogomolnaia A., Moulin H. A new solution to the random assignment problem. J. of Econom. Theory (2001b) . ForthcomingCrossref, Google Scholar
• Crès H., Moulin H. Random priority: a probabilistic resolution of the tragedy of the commons. Cahiers de Recherche HEC (1999) . CR662/1999Google Scholar
• Demers A., Keshav S., Shenker S. Analysis and simulation of a fair queuing algorithm. Internat. Res. and Experience (1990) 1:3–26Google Scholar
• Dolan R. Incentive mechanisms for priority queuing problems. Bell J. Econom. (1979) 421–436Google Scholar
• Friedman E.An incentive compatible scheduling algorithm (1994) (Mimeo, Duke University) Google Scholar
• Gale D.College course assignments and optimal lotteries (1987) (Mimeo, University of California, Berkeley) Google Scholar
• Gelenbe E., Mitrani I.Analysis and Synthesis of Computer Systems Models (1980) (Academic Press, New York) Google Scholar
• Hardy G., Littlewood J. E., Polya G.Inequalities (1934) (Cambridge University Press, Cambridge) Google Scholar
• Hylland A., Zeckhauser R. The efficient allocation of individuals to positions. J. of Political Econom. (1979) 91:293–313Crossref, Google Scholar
• Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B., Graves S. C., Rinnooy Kan A. H. G., Zipkin P. H. Sequencing and Scheduling: Algorithms and Complexity. Logistics of Production and Inventory (1993) (North Holland Press, Amsterdam) Crossref, Google Scholar
• Mendelson H. Pricing computer services: Queuing effects. Comm. ACM (1985) 28:312–321Crossref, Google Scholar
• Mendelson H., Whang S. Optimal incentive compatible pricing for the M/M/1 queue. Oper. Res. (1990) 38:870–883Link, Google Scholar
• Moulin H., Salles M., Weymark J. Procedural versus endstate justice: an implementation view point. Justice, Political Liberalism and Utilitarianism (forthcoming) Proceedings of a conference in honor of John Harsanyi and John Rawls(Cambridge University Press). forthcomingGoogle Scholar
• Naor P. The regulation of queue size by levying tolls. Econometrica (1969) 37:15–24Crossref, Google Scholar
• Nagle J. On packet switches with infinite storage. IEEE Trans. Comm. (1987) 35:435–438Crossref, Google Scholar
• Shenker S. Making greed work in network: a game theoretic analysis of switch service discipline. IEEE/ACM Trans. on Networking (1977) 3:819–831Crossref, Google Scholar
• Suijs J. On incentive compatibility and budget balancedness in public decision making. Econom. Design. (1996) 2:193–209Crossref, Google Scholar
• Zhou S. On a conjecture by Gale about one-sided matching problems. J. Econom. Theory (1990) 52:123–135Crossref, Google Scholar