scientific article; zbMATH DE number 7051200
From MaRDI portal
Publication:4633840
zbMath1425.91030MaRDI QIDQ4633840
Edith Elkind, Dimitrii V. Pasechnik
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496807
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Voting theory (91B12)
Related Items (11)
Finding the nucleoli of large cooperative games ⋮ The Least-Core and Nucleolus of Path Cooperative Games ⋮ Computing the least-core and nucleolus for threshold cardinality matching games ⋮ Arboricity games: the core and the nucleolus ⋮ On the complexity of core, kernel, and bargaining set ⋮ Computing cooperative solution concepts in coalitional skill games ⋮ An algorithm to compute the nucleolus of shortest path games ⋮ The nucleolus of arborescence games in directed acyclic graphs ⋮ Path cooperative games ⋮ Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games ⋮ Computing the nucleolus of weighted voting games in pseudo-polynomial time
This page was built for publication:
