On the computation of the nucleolus of a cooperative game

DOI10.1007/s001820100065zbMath1060.91011OpenAlexW2067156936MaRDI QIDQ1414387

Walter Kern, Ulrich Faigle, Jeroen Kuipers

Publication date: 23 November 2003

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001820100065

Mathematics Subject Classification ID

Cooperative games (91A12) Discrete location and assignment (90B80)

Related Items (21)

Common mistakes in computing the nucleolus ⋮ Finding the nucleoli of large cooperative games ⋮ Approximate nucleolus-based revenue sharing in airline alliances ⋮ On the complexity of nucleolus computation for bipartite \(b\)-matching games ⋮ Cooperative location games based on the minimum diameter spanning Steiner subgraph problem ⋮ Approximating the least core value and least core of cooperative games with supermodular costs ⋮ Fair cost allocations under conflicts - a game-theoretic point of view - ⋮ The least square B-nucleolus for fuzzy cooperative games ⋮ A general characterization for non-balanced games in terms of \(U\)-cycles ⋮ Computing the cores of strategic games with punishment-dominance relations ⋮ Computing solutions for matching games ⋮ Finding nucleolus of flow game ⋮ Computing an element in the lexicographic kernel of a game ⋮ Bargaining dynamics in exchange networks ⋮ Algorithmic Cost Allocation Games: Theory and Applications ⋮ On Chinese postman games where residents of each road pay the cost of their road ⋮ Computing the nucleolus of weighted cooperative matching games in polynomial time ⋮ A COMPUTATIONAL APPROACH TO THE COINCIDENCE OF EGALITARIAN SOLUTIONS FOR COST-SHARING GAMES ⋮ Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation ⋮ Traveling salesman games with the Monge property ⋮ Sharing costs in highways: a game theoretic approach

This page was built for publication: On the computation of the nucleolus of a cooperative game