Discrete hotelling pure location games: potentials and equilibria
We study two-player one-dimensional discrete Hotelling pure location games assuming that demand f(d) as a function of distance d is constant or strictly decreasing. We show that this game admits a best-response potential. This result holds in particular for f(d) = wd with 0 < w ≤ 1. For this case...
Main Authors: | Iimura Takuya, von Mouche Pierre |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2021-08-01
|
Series: | ESAIM: Proceedings and Surveys |
Online Access: | https://www.esaim-proc.org/articles/proc/pdf/2021/02/proc2107115.pdf |
Similar Items
-
Complexity of Pure Equilibria in Bayesian Games
by: Gottlob, G, et al.
Published: (2007) -
Pure Nash Equilibria in Concurrent Deterministic Games
by: Patricia Bouyer, et al.
Published: (2015-06-01) -
Pure Nash Equilibria: Hard and Easy Games
by: Gottlob, G, et al.
Published: (2005) -
Pure Nash equilibria: hard and easy games
by: Gottlob, G, et al.
Published: (2003) -
PPAD-complete approximate pure Nash equilibria in Lipschitz Games
by: Goldberg, P, et al.
Published: (2023)