Congestion games viewed from M-convexity
type: Item
instance of: scholarly article
title: Congestion games viewed from M-convexity
zbMATH Open document ID: 1408.91042
author: Satoru Fujishige
author: Tobias Harks
author: Britta Peis
author: Rico Zenklusen
author: Michel X. Goemans
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
full work available at URL: http://hdl.handle.net/2433/197956
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6945364
zbMATH Keywords: congestion games
zbMATH Keywords: discrete convexity
zbMATH Keywords: best-response dynamics
zbMATH Keywords: M-convex function
MaRDI profile type: Publication
OpenAlex ID: W2171358488
cites work: On the impact of combinatorial structure on congestion games
cites work: Q4681874
cites work: Discrete convexity and equilibria in economies with indivisible goods and money
cites work: Valuated matroids: A new look at the greedy algorithm
cites work: Valuated matroids
cites work: Efficient graph topologies in network routing games
cites work: Congestion games with linearly independent paths: convergence time and price of anarchy
cites work: Submodular functions and optimization.
cites work: \(M\)-convex functions and tree metrics
cites work: Strong equilibrium in congestion games
cites work: Network structure and strong equilibrium in route selection games.
cites work: Greediness and equilibrium in congestion games
cites work: Topological Conditions for Uniqueness of Equilibrium in Networks
cites work: Potential games
cites work: Convexity and Steinitz's exchange property
cites work: Discrete Convex Analysis
cites work: Note on Multimodularity and L-Convexity
cites work: Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Minimization of an M-convex function
cites work: Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
cites work: GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
cites work: Applications of discrete convex analysis to mathematical economics
cites work: Coordinatewise domain scaling algorithm for M-convex function minimization
cites work: Q5524326
cites work: DISCRETE CONCAVITY FOR POTENTIAL GAMES
DOI: 10.1016/J.ORL.2015.04.002
description: scientific article; zbMATH DE number 6945364