Computing the nucleolus of weighted voting games in pseudo-polynomial time

DOI10.1007/s10107-021-01693-4zbMath1501.91039arXiv1810.02670OpenAlexW3196128905MaRDI QIDQ2089798

Kanstantsin Pashkovich

Publication date: 24 October 2022

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingweighted voting gamesnucleolusallocations

Mathematics Subject Classification ID

Cooperative games (91A12) Linear programming (90C05) Algorithmic game theory and complexity (91A68)

Related Items (1)

Simple games versus weighted voting games: bounding the critical threshold value

Cites Work

• Unnamed Item
• On the nucleolus of shortest path games
• Game theoretic analysis of a bankruptcy problem from the Talmud
• Geometric algorithms and combinatorial optimization
• Erratum: ``PRIMES is in P
• A note on the nucleolus and the kernel of the assignment game
• On the nucleolus of neighbor games
• Computing the nucleolus of min-cost spanning tree games is NP-hard.
• On the computational complexity of weighted voting games
• Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
• The Nucleolus of a Characteristic Function Game
• Matching Games: The Least Core and the Nucleolus
• Finding nucleolus of flow game

This page was built for publication: Computing the nucleolus of weighted voting games in pseudo-polynomial time