Network topology and equilibrium existence in weighted network congestion games

Igal Milchtaich

doi:10.1007/s00182-014-0443-9

Network topology and equilibrium existence in weighted network congestion games

Igal Milchtaich

Department of Economics

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

Abstract

Every finite game can be represented as a weighted network congestion game on some undirected two-terminal network. The network topology may reflect certain properties of the game. This paper solves the topological equilibrium-existence problem of identifying all networks on which every weighted network congestion game has a pure-strategy equilibrium.

Original language	English
Pages (from-to)	515-541
Number of pages	27
Journal	International Journal of Game Theory
Volume	44
Issue number	3
Early online date	4 Sep 2014
DOIs	https://doi.org/10.1007/s00182-014-0443-9
State	Published - 31 Aug 2015

Bibliographical note

Publisher Copyright:
© 2014, Springer-Verlag Berlin Heidelberg.

Funding

I thank a referee and an Associate Editor for their comments. This research was supported by the Israel Science Foundation (Grants No. 1082/06 and 1167/12).

Funders	Funder number
Israel Science Foundation
Israel Science Foundation	1082/06, 1167/12

Keywords

Congestion games
Existence of pure-strategy equilibrium
Finite improvement property
Network games

Access to Document

10.1007/s00182-014-0443-9

Cite this

@article{9c407d5829a04198a3b2ccac9feb0ad5,

title = "Network topology and equilibrium existence in weighted network congestion games",

abstract = "Every finite game can be represented as a weighted network congestion game on some undirected two-terminal network. The network topology may reflect certain properties of the game. This paper solves the topological equilibrium-existence problem of identifying all networks on which every weighted network congestion game has a pure-strategy equilibrium.",

keywords = "Congestion games, Existence of pure-strategy equilibrium, Finite improvement property, Network games",

author = "Igal Milchtaich",

note = "Publisher Copyright: {\textcopyright} 2014, Springer-Verlag Berlin Heidelberg.",

year = "2015",

month = aug,

day = "31",

doi = "10.1007/s00182-014-0443-9",

language = "אנגלית",

volume = "44",

pages = "515--541",

journal = "International Journal of Game Theory",

issn = "0020-7276",

publisher = "Springer Verlag",

number = "3",

}

TY - JOUR

T1 - Network topology and equilibrium existence in weighted network congestion games

AU - Milchtaich, Igal

PY - 2015/8/31

Y1 - 2015/8/31

N2 - Every finite game can be represented as a weighted network congestion game on some undirected two-terminal network. The network topology may reflect certain properties of the game. This paper solves the topological equilibrium-existence problem of identifying all networks on which every weighted network congestion game has a pure-strategy equilibrium.

AB - Every finite game can be represented as a weighted network congestion game on some undirected two-terminal network. The network topology may reflect certain properties of the game. This paper solves the topological equilibrium-existence problem of identifying all networks on which every weighted network congestion game has a pure-strategy equilibrium.

KW - Congestion games

KW - Existence of pure-strategy equilibrium

KW - Finite improvement property

KW - Network games

UR - https://www.scopus.com/pages/publications/85028229861

U2 - 10.1007/s00182-014-0443-9

DO - 10.1007/s00182-014-0443-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85028229861

SN - 0020-7276

VL - 44

SP - 515

EP - 541

JO - International Journal of Game Theory

JF - International Journal of Game Theory

IS - 3

ER -

Network topology and equilibrium existence in weighted network congestion games

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this