A general framework for computing the nucleolus via dynamic programming

DOI10.1007/978-3-030-57980-7_20zbMATH Open1503.91019arXiv2005.10853OpenAlexW3089737151MaRDI QIDQ2109970FDOQ2109970

Authors: Jochen Könemann, Justin Toth 

Publication date: 21 December 2022

Abstract: This paper defines a general class of cooperative games for which the nucleolus is efficiently computable. This class includes new members for which the complexity of computing their nucleolus was not previously known. We show that when the minimum excess coalition problem of a cooperative game can be formulated as a hypergraph dynamic program its nucleolus is efficiently computable. This gives a general technique for designing efficient algorithms for computing the nucleolus of a cooperative game. This technique is inspired by a recent result of Pashkovich (2018) on weighted voting games. However our technique significantly extends beyond the capabilities of previous work. We demonstrate this by applying it to give an algorithm for computing the nucleolus of b-matching games in polynomial time on graphs of bounded treewidth.

Full work available at URL: https://arxiv.org/abs/2005.10853

Recommendations

• Computing the nucleolus of weighted cooperative matching games in polynomial time
• Computing the nucleolus of weighted cooperative matching games in polynomial time
• On the computation of the nucleolus of a cooperative game
• The complexity of the nucleolus in compact games
• On finding the nucleolus of an \(n\)-person cooperative game

zbMATH Keywords

combinatorial optimizationdynamic programmingalgorithmic game theory

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Cooperative games (91A12) Algorithmic game theory and complexity (91A68)

Cited In (6)

• On the complexity of nucleolus computation for bipartite \(b\)-matching games
• On the computation of the nucleolus of a cooperative game
• The complexity of matching games: a survey
• Computing the nucleolus of weighted cooperative matching games in polynomial time
• Title not available (Why is that?)
• Computing the nucleolus of weighted voting games in pseudo-polynomial time

This page was built for publication: A general framework for computing the nucleolus via dynamic programming

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