On computational complexity of membership test in flow games and linear production games

DOI10.1007/S001820200106zbMath1083.91017OpenAlexW2043805446MaRDI QIDQ1414436

Qizhi Fang, Shanfeng Zhu, Xiaotie Deng, Mao-cheng Cai

Publication date: 23 November 2003

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001820200106

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Cooperative games (91A12) Games involving graphs (91A43) Production models (90B30) (n)-person games, (n>2) (91A06)

Related Items (13)

COALITION FORMATION GAMES: A SURVEY ⋮ The Least-Core and Nucleolus of Path Cooperative Games ⋮ Unnamed Item ⋮ Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms ⋮ Computing the least-core and nucleolus for threshold cardinality matching games ⋮ Arboricity games: the core and the nucleolus ⋮ The computational complexity of rationalizing boundedly rational choice behavior ⋮ Finding nucleolus of flow game ⋮ Enforcing fair cooperation in production-inventory settings with heterogeneous agents ⋮ Computability of simple games: A characterization and application to the core ⋮ On characterization of the core of lane covering games via dual solutions ⋮ Path cooperative games ⋮ The nucleolus of balanced simple flow networks

This page was built for publication: On computational complexity of membership test in flow games and linear production games