Bounds on the Cost of Stabilizing a Cooperative Game

DOI10.1613/jair.1.11270zbMath1454.91012OpenAlexW2908115881WikidataQ62044175 ScholiaQ62044175MaRDI QIDQ4611396

Reshef Meir, Jeffrey S. Rosenschein, Michael Zuckerman, Enrico Malizia, Yoram Bachrach, Jörg Rothe, Edith Elkind, Dimitrii V. Pasechnik

Publication date: 18 January 2019

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11270

zbMATH Keywords

computational complexitycooperative gamesuperadditivityanonymitycoalitional stabilitycost of stability

Mathematics Subject Classification ID

Cooperative games (91A12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithmic game theory and complexity (91A68)

Related Items (2)

Stability, vertex stability, and unfrozenness for special graph classes ⋮ Simple games versus weighted voting games: bounding the critical threshold value

This page was built for publication: Bounds on the Cost of Stabilizing a Cooperative Game