Random Order Congestion Games

References

• Angel E., Bampis E., Pascual F. Truthful algorithms for scheduling selfish tasks on parallel machines. Proc. 1st Workshop Internet Network Econom. (WINE 05) (2005) 698–707Crossref, Google Scholar
• Auletta V., Prisco R., Penna P., Persiano G. Deterministic truthful approximation mechanisms for scheduling related machines. Proc. 21st Sympos. Theoret. Aspects Comput. Sci. (STACS 04) (2004) 608–619Crossref, Google Scholar
• Carroll T., Grosu D. Selfish multi-user task scheduling. Proc. 4th Internat. Sympos. Parallel Distributed Comput. (ISPDC 06) (2006) (IEEE Computer Society, Washington, DC) 99–106Crossref, Google Scholar
• Christodoulou G., Koutsoupias E. The price of anarchy of finite congestion games. Proc. 37th Annual ACM Sympos. Theory Comput. (STOC 05) (2005) (ACM Press, New York) 67–73Crossref, Google Scholar
• Fabrikant A., Papadimitriou C., Talwar K. The complexity of pure Nash equilibria. (2004) (ACM Press, New York) 604–612Crossref, Google Scholar
• Grosu D., Carroll T. A strategyproof mechanism for scheduling divisible loads in distributed systems. Proc. 4th Internat. Sympos. Parallel Distributed Comput. (ISPDC 05) (2005) (IEEE Computer Society, Washington, DC) 83–90Crossref, Google Scholar
• Koutsoupias E. Selfish task allocation. Bull. Eur. Assoc. Theoret. Comput. Sci. (2003) 81(October):79–88Google Scholar
• Milchtaich I. Congestion games with player-specific payoff functions. Games Econom. Behav. (1996) 13(1):111–124Crossref, Google Scholar
• Monderer D. Solution-based congestion games. Adv. Math. Econom. (2006) 8(February):397–407Crossref, Google Scholar
• Monderer D., Shapley L. Potential games. Games Econom. Behav. (1996) 14(1):124–143Crossref, Google Scholar
• Monderer D., Tennenholtz M. Distributed games. Games Econom. Behav. (1999) 28(1):181–188Crossref, Google Scholar
• Nisan N., Ronen A. Algorithmic mechanism design. Games Econom. Behav. (2001) 35(1/2):166–196Crossref, Google Scholar
• Penn M., Polukarov M., Tennenholtz M. Congestion games with failures. Proc. 6th ACM Conf. Electronic Commerce (EC 05) (2005) 259–268Crossref, Google Scholar
• Penn M., Polukarov M., Tennenholtz M. Asynchronous congestion games. Proc. 7th Internat. Conf. Autonomous Agents and Multiagent Systems (AAMAS 08) (2008) (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC) 1605–1608Google Scholar
• Penn M., Polukarov M., Tennenholtz M. Congestion games with load-dependent failures: Identical resources. Games Econom. Behavior (2009) 67(1):156–173Crossref, Google Scholar
• Rosenthal R. A class of games possessing pure-strategy Nash equilibria. Internat. J. Game Theory (1973) 2:65–67Crossref, Google Scholar