Goal-directed Unbounded Coalitional Game and Its Complexity

DOI10.1142/9789814678001_0010MaRDI QIDQ2989970zbMATH OpenOpenAlexFDO

Authors Hu Liu

Publication date 9 June 2017

Published in Proceedings of the 13th Asian Logic Conference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789814678001_0010

zbMATH Keywords

extended coalitional gamegoal-directed game

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Algorithmic game theory and complexity (91A68)

Recommendations

• On the computational complexity of qualitative coalitional games
• The unbinding core for coalitional form games
• A Unified Strategy for Solution Seeking in Graphical $N$-Coalition Noncooperative Games
• Computational complexity of a solution for directed graph cooperative games
• On the computational complexity of coalitional resource games
• On robustness and dynamics in (un)balanced coalitional games
• Cooperation and computability in \(n\)-player games
• Decomposition and Representation of Coalitional Games
• scientific article; zbMATH DE number 3995482

Cited in

(3)

• Achieving Unbounded Resolution inFinitePlayer Goore Games Using Stochastic Automata, and Its Applications
• A Unified Strategy for Solution Seeking in Graphical $N$-Coalition Noncooperative Games
• On the computational complexity of qualitative coalitional games

This page was built for publication: Goal-directed Unbounded Coalitional Game and Its Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989970)