On computational complexity of membership test in flow games and linear production games
From MaRDI portal
Publication:1414436
DOI10.1007/s001820200106zbMath1083.91017MaRDI 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
68Q25: Analysis of algorithms and problem complexity
90C60: Abstract computational complexity for mathematical programming problems
91A12: Cooperative games
91A43: Games involving graphs
90B30: Production models
91A06: (n)-person games, (n>2)
Related Items
Finding nucleolus of flow game, Path cooperative games, The nucleolus of balanced simple flow networks, Computing the least-core and nucleolus for threshold cardinality matching games, On characterization of the core of lane covering games via dual solutions, Enforcing fair cooperation in production-inventory settings with heterogeneous agents, The computational complexity of rationalizing boundedly rational choice behavior, Computability of simple games: A characterization and application to the core, Arboricity games: the core and the nucleolus, Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms, The Least-Core and Nucleolus of Path Cooperative Games, COALITION FORMATION GAMES: A SURVEY, Unnamed Item
