Network topology and equilibrium existence in weighted network congestion games

Igal Milchtaich

doi:https://doi.org/10.1007/s00182-014-0443-9

Network topology and equilibrium existence in weighted network congestion games

Igal Milchtaich

Department of Economics

Bar-Ilan University

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

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

Keywords

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

All Science Journal Classification (ASJC) codes

Statistics and Probability
Mathematics (miscellaneous)
Social Sciences (miscellaneous)
Economics and Econometrics
Statistics, Probability and Uncertainty

Access to Document

https://doi.org/10.1007/s00182-014-0443-9

Cite this

@article{d6687b44703b43c5804d31f373e50303,

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 = "https://doi.org/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 - http://www.scopus.com/inward/record.url?scp=85028229861&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/s00182-014-0443-9

DO - https://doi.org/10.1007/s00182-014-0443-9

M3 - مقالة

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

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this