A non-cooperative game theory approach to cost sharing in networks
type: Item
instance of: scholarly article
title: A non-cooperative game theory approach to cost sharing in networks
zbMATH Open document ID: 1482.91007
author: Yanyan Li
published in: Mathematical Methods of Operations Research
publication date: 2022-01-18T00:00:00Z
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 7458097
zbMATH Keywords: capacity synthesis problem
zbMATH Keywords: non-cooperative network game
zbMATH Keywords: Nash equilibrium
MaRDI profile type: Publication
full work available at URL: s00186-021-00754-w
OpenAlex ID: W3210862190
cites work: Q3056948
cites work: A non-cooperative approach to the cost spanning tree problem.
cites work: Characterization of monotonic rules in minimum cost spanning tree problems
cites work: On cost allocation for a spanning tree: A game theoretic approach
cites work: Sharing a minimal cost spanning tree: beyond the folk solution
cites work: Sharing the Cost of a Capacity Network
cites work: Inefficiency of Nash Equilibria
cites work: Opportune moment strategies for a cost spanning tree game
cites work: On the core and nucleolus of minimum cost spanning tree games
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Cost sharing in networks: some open questions
cites work: The degree and cost adjusted folk solution for minimum cost spanning tree games
cites work: On the core of network synthesis games
cites work: On the set of extreme core allocations for minimal cost spanning tree problems
cites work: Spanning Trees and Optimization Problems
DOI: 10.1007/S00186-021-00754-W
description: scientific article; zbMATH DE number 7458097