Fair cost allocations under conflicts - a game-theoretic point of view -

DOI10.1016/j.disopt.2007.10.002zbMath1137.91506OpenAlexW1983125930MaRDI QIDQ924627

Yoshio Okamoto

Publication date: 16 May 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2007.10.002

zbMATH Keywords

cooperative gamealgorithmic game theorysolution concepttransferable utility gamecombinatorial optimization game

Mathematics Subject Classification ID

Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (6)

Minimum coloring problems with weakly perfect graphs ⋮ Simple and three-valued simple minimum coloring games ⋮ Clique games: a family of games with coincidence between the nucleolus and the Shapley value ⋮ On the cores of games arising from integer edge covering functions of graphs ⋮ Monotonic stable solutions for minimum coloring games ⋮ The nucleolus of arborescence games in directed acyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• The strong perfect graph theorem
• Counting the number of independent sets in chordal graphs
• The Shapley value for cooperative games under precedence constraints
• Geometric algorithms and combinatorial optimization.
• Clique polynomials and independent set polynomials of graphs
• An algorithm for finding the nucleolus of assignment games
• On certain polytopes associated with graphs
• On the computation of the nucleolus of a cooperative game
• Submodularity of some classes of the combinatorial optimization games
• Totally balanced combinatorial optimization games
• Algorithmic graph theory and perfect graphs
• Computing the nucleolus of min-cost spanning tree games is NP-hard.
• Incidence matrices and interval graphs
• Recognizing Berge graphs
• Cores of convex games
• Anti-blocking polyhedra
• Normal hypergraphs and the perfect graph conjecture
• The Complexity of Counting in Sparse, Regular, and Planar Graphs
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• On the Complexity of Cooperative Solution Concepts
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Core Stability of Minimum Coloring Games
• The Nucleolus of a Characteristic Function Game

This page was built for publication: Fair cost allocations under conflicts - a game-theoretic point of view -