LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES
From MaRDI portal
Recommendations
Cites work
- A dual ascent approach for steiner tree problems on a directed graph
- A generalized linear production model: A unifying model
- A Note on the Room-Mates Problem and a Related Revenue Allocation Problem
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
- Generalized Network Problems Yielding Totally Balanced Games
- Minimum cost spanning tree games
- On cost allocation for a spanning tree: A game theoretic approach
- On the core of linear production games
- On the core of network synthesis games
- Solving covering problems and the uncapacitated plant location problem on trees
- The assignment game. I: The core
- Totally balanced combinatorial optimization games
- Totally Balanced Games and Games of Flow
Cited in
(11)- Linear and symmetric allocation methods for partially defined cooperative games
- The fairest core in cooperative games with transferable utilities
- Integer programming methods for solving binary interdiction games
- Development and analysis of high performance parallel algorithms for solving cooperative games
- Vector Optimization and Cooperative Games
- scientific article; zbMATH DE number 440595 (Why is no real title available?)
- scientific article; zbMATH DE number 1054569 (Why is no real title available?)
- scientific article; zbMATH DE number 1929535 (Why is no real title available?)
- Generating empirical core size distributions of hedonic games using a Monte Carlo method
- Stable k-person coalitions in an n-person cooperative game
- Condorcet winners for public goods
This page was built for publication: LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3021975)