On computational complexity of membership test in flow games and linear production games
type: Item
instance of: scholarly article
title: On computational complexity of membership test in flow games and linear production games
zbMATH Open document ID: 1083.91017
author: Qizhi Fang
author: Shanfeng Zhu
author: Xiaotie Deng
author: Mao-Cheng Cai
published in: International Journal of Game Theory
publication date: 2003-11-23T00:00:00Z
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91A06
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 2006711
MaRDI profile type: Publication
full work available at URL: s001820200106
OpenAlex ID: W2043805446
DOI: 10.1007/S001820200106
Recommended article: On the complexity of testing membership in the core of min-cost spanning tree games
Recommended article: Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games
Recommended article: Algorithms for core stability, core largeness, exactness, and extendability of flow games
Recommended article: Q4263796
Recommended article: On the computational complexity of decision problems about multi-player Nash equilibria
Recommended article: Complexity of Verifying Game Equilibria
Recommended article: The Computational Complexity of Nash Equilibria in Concisely Represented Games
Recommended article: On the computational complexity of coalitional resource games
Recommended article: On Complexity of Flooding Games on Graphs with Interval Representations
description: scientific article; zbMATH DE number 2006711