LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES

DOI10.1142/S0129054102001357zbMath1066.91010OpenAlexW2040433374MaRDI QIDQ3021975

Qizhi Fang, Shanfeng Zhu

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054102001357

zbMATH Keywords

cooperative gamescoreduality theorylinear programinteger program

Mathematics Subject Classification ID

Integer programming (90C10) Cooperative games (91A12) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Condorcet winners for public goods

Cites Work

• On the core of network synthesis games
• Totally balanced combinatorial optimization games
• Solving covering problems and the uncapacitated plant location problem on trees
• The assignment game. I: The core
• A dual ascent approach for steiner tree problems on a directed graph
• A Note on the Room-Mates Problem and a Related Revenue Allocation Problem
• A generalized linear production model: A unifying model
• Minimum cost spanning tree games
• Generalized Network Problems Yielding Totally Balanced Games
• Totally Balanced Games and Games of Flow
• Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
• On the core of linear production games
• On cost allocation for a spanning tree: A game theoretic approach
• Algorithmic Aspects of the Core of Combinatorial Optimization Games

This page was built for publication: LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES