Universally balanced combinatorial optimization games
From MaRDI portal
Publication:2344942
DOI10.3390/g1030299zbMath1311.91016OpenAlexW2169637412MaRDI QIDQ2344942
Xiaotie Deng, Gabrielle Demange
Publication date: 19 May 2015
Published in: Games (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/g1030299
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The strong perfect graph theorem
- The complexity of recognizing linear systems with certain integrality properties
- Cores of partitioning games
- Strongly balanced cooperative games
- Stable families of coalitions and normal hypergraphs
- Intermediate preferences and stable coalition structures
- NP-completeness in hedonic games
- Recognizing Berge graphs
- The assignment game. I: The core
- On the core of linear production games
- 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
- Paths, Trees, and Flowers
- The Core of an N Person Game
This page was built for publication: Universally balanced combinatorial optimization games