Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure
We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of pure Nash equilibria is guaranteed by potential function arguments. Unfortunately, this proof of existence is ineff...
Saved in:
Main Authors: | , , , |
---|---|
其他作者: | |
格式: | Conference or Workshop Item |
語言: | English |
出版: |
2013
|
在線閱讀: | https://hdl.handle.net/10356/98777 http://hdl.handle.net/10220/12552 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |