Computing equilibrium in network utility-sharing and discrete election games
type: Item
instance of: scholarly article
title: Computing equilibrium in network utility-sharing and discrete election games
zbMATH Open document ID: 1503.91037
author: Rahul Swamy
author: Timothy Murray
published in: Journal of Combinatorial Optimization
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05C57
Mathematics Subject Classification ID: 91A11
Mathematics Subject Classification ID: 91A14
zbMATH DE Number: 7595933
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: Hotelling-Downs
zbMATH Keywords: network utility-sharing game
MaRDI profile type: Publication
full work available at URL: s10878-020-00554-8
OpenAlex ID: W3023583468
cites work: Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
cites work: Pure Nash equilibria in player-specific and weighted congestion games
cites work: The Hotelling-Downs model with runoff voting
cites work: Q5365081
cites work: Electoral competition with policy-motivated candidates
cites work: The Existence of Equilibria in the 3-Facility Hotelling Model in a Tree
cites work: Competitive Location Models: A Framework and Bibliography
cites work: The complexity of pure Nash equilibria
cites work: Congestion Games with Mixed Objectives
cites work: Approximation and Online Algorithms
cites work: Orienteering for electioneering
cites work: Voting Equilibria in Multidimensional Choice Spaces
cites work: Candidate positioning and entry in a political competition
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: A Hotelling-Downs model of electoral competition with the option to quit
cites work: Linear-time computability of combinatorial problems on series-parallel graphs
DOI: 10.1007/S10878-020-00554-8
description: scientific article; zbMATH DE number 7595933