Algorithmic Aspects of the Core of Combinatorial Optimization Games

DOI10.1287/moor.24.3.751zbMath1064.91505MaRDI QIDQ4951047

Toshihide Ibaraki, Hiroshi Nagamochi, Xiaotie Deng

Publication date: 19 July 2000

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.24.3.751

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C10: Integer programming

91A12: Cooperative games

91A46: Combinatorial games

Related Items

Finding nucleolus of flow game, On the cores of games arising from integer edge covering functions of graphs, Recent development in computational complexity characterization of Nash equilibrium, Buyer-supplier games: optimization over the core, On the complexity of core, kernel, and bargaining set, Computing solutions for matching games, Dominating set games., Social exchange networks with distant bargaining, Complexity of core allocation for the bin packing game, Fair cost allocations under conflicts - a game-theoretic point of view -, Approximately fair cost allocation in metric traveling salesman games, Production-inventory games and PMAS-games: Characterizations of the Owen point, Non-cooperative facility location and covering games, Production-inventory games: A new class of totally balanced combinatorial optimization games, On core stability, vital coalitions, and extendability, On complexity of single-minded auction, Total balancedness condition for Steiner tree games., Traveling salesman games with the Monge property, Strategic cooperation in cost sharing games, Monotonic stable solutions for minimum coloring games, Algorithms for core stability, core largeness, exactness, and extendability of flow games, Balancedness of edge covering games, A fast approximation algorithm for solving the complete set packing problem, A note on balancedness of dominating set games, New techniques for cost sharing in combinatorial optimization games, The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems, LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES, ASSIGNMENT SITUATIONS WITH MULTIPLE OWNERSHIP AND THEIR GAMES