Computing the nucleolus of weighted voting games

MaRDI QIDQ4633840zbMATH OpenFDO

Authors Edith Elkind, Dmitrii V. Pasechnik

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496807

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Voting theory (91B12)

Recommendations

• Computing the nucleolus of weighted voting games in pseudo-polynomial time
• On the computational complexity of weighted voting games
• The complexity of the nucleolus in compact games
• The least core, nucleolus, and kernel of homogeneous weighted majority games
• Weighted voting games

Cited in

(16)

• Computing the nucleolus of weighted voting games in pseudo-polynomial time
• On the computational complexity of weighted voting games
• An algorithm to compute the nucleolus of shortest path games
• Arboricity games: the core and the nucleolus
• Path cooperative games
• Computing the least-core and nucleolus for threshold cardinality matching games
• Finding the nucleoli of large cooperative games
• The nucleolus of arborescence games in directed acyclic graphs
• Computing cooperative solution concepts in coalitional skill games
• Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
• Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games
• Weighted nucleoli and dually essential coalitions
• On the complexity of core, kernel, and bargaining set
• The Least-Core and Nucleolus of Path Cooperative Games
• Analyzing power in weighted voting games with super-increasing weights
• Analyzing power in weighted voting games with super-increasing weights

This page was built for publication: Computing the nucleolus of weighted voting games

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