Algorithmic Aspects of the Core of Combinatorial Optimization Games
From MaRDI portal
Publication:4951047
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
68Q25: Analysis of algorithms and problem complexity
90C10: Integer programming
91A12: Cooperative games
91A46: Combinatorial games
Related Items
Graph Stabilization: A Survey, Finding nucleolus of flow game, Computing the nucleolus of weighted cooperative matching games in polynomial time, Stochastic linear programming games with concave preferences, Simple and three-valued simple minimum coloring games, On the cores of games arising from integer edge covering functions of graphs, Recent development in computational complexity characterization of Nash equilibrium, Dynamic linear programming games with risk-averse players, Efficient stabilization of cooperative matching games, 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, Computing the least-core and nucleolus for threshold cardinality matching games, Network bargaining: using approximate blocking sets to stabilize unstable instances, 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, Three-valued simple games, The stable fixtures problem with payments, A note on maximal covering location games, On complexity of single-minded auction, The nucleolus of arborescence games in directed acyclic graphs, Total balancedness condition for Steiner tree games., Traveling salesman games with the Monge property, Strategic cooperation in cost sharing games, Population monotonic allocation schemes for vertex cover games, Clique games: a family of games with coincidence between the nucleolus and the Shapley value, Allocating costs in set covering problems, Monotonic stable solutions for minimum coloring games, Algorithms for core stability, core largeness, exactness, and extendability of flow games, Multi-sided assignment games on \(m\)-partite graphs, Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value, Network strength games: the core and the nucleolus, Gain-sharing in urban consolidation centers, Cooperative games with overlapping coalitions: charting the tractability frontier, Universally balanced combinatorial optimization 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 Stable Fixtures Problem with Payments, The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems, Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation, LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES, Stabilizing Weighted Graphs, ASSIGNMENT SITUATIONS WITH MULTIPLE OWNERSHIP AND THEIR GAMES, Component Acquisition Games, Computing Stable Coalitions: Approximation Algorithms for Reward Sharing
