Decentralized utilitarian mechanisms for scheduling games
- 31 July 2015
- journal article
- research article
- Published by Elsevier in Games and Economic Behavior
- Vol. 92, 306-326
- https://doi.org/10.1016/j.geb.2013.03.011
Abstract
No abstract availableKeywords
Funding Information
- NSF (CCF0830516, CCF1217989, CCF1115849)
- FONDECYT (1090050)
- Andreas Mentzelopoulos Scholarships
This publication has 36 references indexed in Scilit:
- Taxes for linear atomic congestion gamesACM Transactions on Algorithms, 2010
- Tight bounds for worst-case equilibriaACM Transactions on Algorithms, 2007
- Tradeoffs in worst-case equilibriaTheoretical Computer Science, 2006
- A blueprint for introducing disruptive technology into the InternetACM SIGCOMM Computer Communication Review, 2003
- Convex quadratic and semidefinite programming relaxations in schedulingJournal of the ACM, 2001
- Achieving network optima using Stackelberg routing strategiesIEEE/ACM Transactions on Networking, 1997
- The Competitiveness of On-Line AssignmentsJournal of Algorithms, 1995
- Self-organizing sequential search and Hilbert's inequalitiesJournal of Computer and System Sciences, 1988
- Algorithms for Scheduling Tasks on Unrelated ProcessorsJournal of the ACM, 1981
- A linear time approximation algorithm for multiprocessor schedulingBIT Numerical Mathematics, 1979