Equilibrium analysis of customer attraction games

DOI10.1007/978-3-031-48974-7_14MaRDI QIDQ6609143zbMATH OpenFDO

Authors Xiaotie Deng, Ningyuan Li, Weian Li, Qi Qi

Publication date 20 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48974-7_14

zbMATH Keywords

asymmetrycomplexitycustomer attraction gameprice of anarchypure Nash equilibriumsequential game

Mathematics Subject Classification ID

Internet topics (68M11) Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites work

• A class of games possessing pure-strategy Nash equilibria
• Algorithms – ESA 2005
• Competitive facility location: the Voronoi game
• Competitive Location Models: A Framework and Bibliography
• Discrete hotelling pure location games: potentials and equilibria
• Equilibria in Competitive Location Models
• Exact price of anarchy for polynomial congestion games
• Hotelling games with random tolerance intervals
• How bad is selfish routing?
• Nash Equilibria in Voronoi Games on Graphs
• Network design with weighted players
• On the existence of pure Nash equilibria in weighted congestion games
• Potential games
• Project games
• Sequential solutions in machine scheduling games
• Shapley Facility Location Games
• The curse of simultaneity
• The Price of Stability for Network Design with Fair Cost Allocation
• The sequential price of anarchy for atomic congestion games
• Tight bounds for worst-case equilibria
• Voronoi game on graphs
• Voronoi Games on Cycle Graphs
• Worst-case equilibria

This page was built for publication: Equilibrium analysis of customer attraction games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609143)