Dr George Mertzios george.mertzios@durham.ac.uk
Associate Professor
In this paper we investigate the splittable routing game in a series-parallel network with two selfish players. Every player wishes to route optimally, i.e. at minimum cost, an individual flow demand from the source to the destination, giving rise to a non-cooperative game. We allow a player to split his flow along any number of paths. One of the fundamental questions in this model is the convergence of the best response dynamics to a Nash equilibrium, as well as the time of convergence. We prove that this game converges indeed to a Nash equilibrium in a logarithmic number of steps. Our results hold for increasing and convex player-specific latency functions. Finally, we prove that our analysis on the convergence time is tight for affine latency functions.
Presentation Conference Type | Conference Paper (Published) |
---|---|
Conference Name | International Conference on Theoretical and Mathematical Foundations of Computer Science (TMFCS- 09) |
Start Date | Jul 13, 2009 |
End Date | Jul 16, 2009 |
Publication Date | Jul 1, 2009 |
Deposit Date | Dec 8, 2011 |
Pages | 28-33 |
Public URL | https://durham-repository.worktribe.com/output/1158570 |
Publisher URL | http://www.promoteresearch.org/2009/proceedings-listing-2009/tmfcs09.html |
Additional Information | Conference dates: July 13-16, 2009 |
The complexity of growing a graph
(2022)
Presentation / Conference Contribution
Payment scheduling in the Interval Debt Model
(2023)
Presentation / Conference Contribution
The complexity of computing optimum labelings for temporal connectivity
(2022)
Presentation / Conference Contribution
The complexity of temporal vertex cover in small-degree graphs
(2022)
Presentation / Conference Contribution
The complexity of transitively orienting temporal graphs
(2021)
Presentation / Conference Contribution
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
Apache License Version 2.0 (http://www.apache.org/licenses/)
Apache License Version 2.0 (http://www.apache.org/licenses/)
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search