Approximate Strong Equilibrium in Job Scheduling Games-Reference-Cited by-同舟云学术

Approximate Strong Equilibrium in Job Scheduling Games

Published:2008 Issue: Volume: Page:58-69
ISSN:0302-9743
Container-title:Algorithmic Game Theory
language:
Short-container-title:

Author:

Feldman Michal,Tamir Tami

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-79309-0_7

Reference27 articles.

1. Albers, S.: On the value of coordination in network design. In: SODA (2008)

2. Albers, S., Elits, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash Equilibria for a Network Creation Game. In: SODA (2006)

3. Andelman, N., Feldman, M., Mansour, Y.: Strong Price of Anarchy. In: SODA (2007)

4. Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, É., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: FOCS, pp. 295–304 (2004)

5. Anshelevich, E., Dasgupta, A., Tardos, E., Wexler, T.: Near-Optimal Network Design with Selfish Agents. In: STOC (2003)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Game-Theoretic Approach for Grace-Period Policy in Supercomputers;2021 IEEE 24th International Conference on Information Fusion (FUSION);2021-11-01

2. A Nash bargaining model for flow shop scheduling problem under uncertainty: a case study from tire manufacturing in Iran;The International Journal of Advanced Manufacturing Technology;2018-01-24

3. A distributed scheduling framework based on selfish autonomous agents for federated cloud environments;Future Generation Computer Systems;2013-08

4. Selfish bin covering;Theoretical Computer Science;2011-11

5. Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games;Algorithmic Game Theory;2010