Membership for Core of LP Games and Other Games
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Total balancedness condition for Steiner tree games
Discrete Applied Mathematics
Matching games: the least core and the nucleolus
Mathematics of Operations Research
Cooperative facility location games
Journal of Algorithms - Special issue: SODA 2000
Traveling salesman games with the Monge property
Discrete Applied Mathematics
On complexity of single-minded auction
Journal of Computer and System Sciences
Core Stability of Minimum Coloring Games
Mathematics of Operations Research
Restricted Core Stability of Flow Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Non-cooperative facility location and covering games
Theoretical Computer Science
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Core stability of vertex cover games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Buyer-supplier games: optimization over the core
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Some new cooperative coverage facility location games
Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions
Buyer-games: Optimization over the core
Theoretical Computer Science
Strategic cooperation in cost sharing games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
On the complexity of core, kernel, and bargaining set
Artificial Intelligence
Approximate fair cost allocation in metric traveling salesman games
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On solution concepts for matching games
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Core stability of minimum coloring games
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Complexity of core allocation for the bin packing game
Operations Research Letters
Recent development in computational complexity characterization of Nash equilibrium
Computer Science Review
Fair cost allocations under conflicts - a game-theoretic point of view -
Discrete Optimization
Operations Research Letters
Algorithms for core stability, core largeness, exactness, and extendability of flow games
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Network bargaining: using approximate blocking sets to stabilize unstable instances
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
LP-Based covering games with low price of anarchy
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
On the cores of games arising from integer edge covering functions of graphs
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We discuss an integer programming formulation for a class of cooperative games. We focus on algorithmic aspects of the core, one of the most important solution concepts in cooperative game theory. Central to our study is a simple (but very useful) observation that the core for this class is nonempty if and only if an associated linear program has an integer optimal solution. Based on this, we study the computational complexity and algorithms to answer important questions about the cores of various games on graphs, such as maximum flow, connectivity, maximum matching, minimum vertex cover, minimum edge cover, maximum independent set, and minimum coloring.