Congestion Games and Potentials Reconsidered

M. Voorneveld, P.E.M. Borm, F.J.C. van Megen, S.H. Tijs, G. Facchini

Research output: Working paper › Discussion paper › Other research output

327 Downloads (Pure)

Abstract

In congestion games, players use facilities from a common pool. The benefit that a player derives from using a facility depends, possibly among other things, on the number of users of this facility. The paper gives an easy alternative proof of the isomorphism between exact potential games and the set of congestion games introduced by Rosenthal (1973). It clarifies the relations between existing models on congestion games, and studies a class of congestion games where the sets of Nash equilibria, strong Nash equilibria and potential-maximizing strategies coincide. Particular emphasis is on the computation of potential-maximizing strategies.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages21
Volume1999-98
Publication statusPublished - 1999

Publication series

NameCentER Discussion Paper
Volume1999-98

Fingerprint

Congestion games
Isomorphism
Potential games
Nash equilibrium
Common pool
Strong Nash equilibrium

Keywords

  • potential games
  • congestion
  • strong Nash equilibrium
  • potential-maximizing strategies

Cite this

Voorneveld, M., Borm, P. E. M., van Megen, F. J. C., Tijs, S. H., & Facchini, G. (1999). Congestion Games and Potentials Reconsidered. (CentER Discussion Paper; Vol. 1999-98). Tilburg: Operations research.
Voorneveld, M. ; Borm, P.E.M. ; van Megen, F.J.C. ; Tijs, S.H. ; Facchini, G. / Congestion Games and Potentials Reconsidered. Tilburg : Operations research, 1999. (CentER Discussion Paper).
@techreport{1d647323c17d41e9a4d58749e2ea4dc3,
title = "Congestion Games and Potentials Reconsidered",
abstract = "In congestion games, players use facilities from a common pool. The benefit that a player derives from using a facility depends, possibly among other things, on the number of users of this facility. The paper gives an easy alternative proof of the isomorphism between exact potential games and the set of congestion games introduced by Rosenthal (1973). It clarifies the relations between existing models on congestion games, and studies a class of congestion games where the sets of Nash equilibria, strong Nash equilibria and potential-maximizing strategies coincide. Particular emphasis is on the computation of potential-maximizing strategies.",
keywords = "potential games, congestion, strong Nash equilibrium, potential-maximizing strategies",
author = "M. Voorneveld and P.E.M. Borm and {van Megen}, F.J.C. and S.H. Tijs and G. Facchini",
note = "Pagination: 21",
year = "1999",
language = "English",
volume = "1999-98",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

Voorneveld, M, Borm, PEM, van Megen, FJC, Tijs, SH & Facchini, G 1999 'Congestion Games and Potentials Reconsidered' CentER Discussion Paper, vol. 1999-98, Operations research, Tilburg.

Congestion Games and Potentials Reconsidered. / Voorneveld, M.; Borm, P.E.M.; van Megen, F.J.C.; Tijs, S.H.; Facchini, G.

Tilburg : Operations research, 1999. (CentER Discussion Paper; Vol. 1999-98).

Research output: Working paper › Discussion paper › Other research output

TY - UNPB

T1 - Congestion Games and Potentials Reconsidered

AU - Voorneveld, M.

AU - Borm, P.E.M.

AU - van Megen, F.J.C.

AU - Tijs, S.H.

AU - Facchini, G.

N1 - Pagination: 21

PY - 1999

Y1 - 1999

N2 - In congestion games, players use facilities from a common pool. The benefit that a player derives from using a facility depends, possibly among other things, on the number of users of this facility. The paper gives an easy alternative proof of the isomorphism between exact potential games and the set of congestion games introduced by Rosenthal (1973). It clarifies the relations between existing models on congestion games, and studies a class of congestion games where the sets of Nash equilibria, strong Nash equilibria and potential-maximizing strategies coincide. Particular emphasis is on the computation of potential-maximizing strategies.

AB - In congestion games, players use facilities from a common pool. The benefit that a player derives from using a facility depends, possibly among other things, on the number of users of this facility. The paper gives an easy alternative proof of the isomorphism between exact potential games and the set of congestion games introduced by Rosenthal (1973). It clarifies the relations between existing models on congestion games, and studies a class of congestion games where the sets of Nash equilibria, strong Nash equilibria and potential-maximizing strategies coincide. Particular emphasis is on the computation of potential-maximizing strategies.

KW - potential games

KW - congestion

KW - strong Nash equilibrium

KW - potential-maximizing strategies

M3 - Discussion paper

VL - 1999-98

T3 - CentER Discussion Paper

BT - Congestion Games and Potentials Reconsidered

PB - Operations research

CY - Tilburg

ER -

Voorneveld M, Borm PEM, van Megen FJC, Tijs SH, Facchini G. Congestion Games and Potentials Reconsidered. Tilburg: Operations research. 1999. (CentER Discussion Paper).

Access to Document