Approximate cores of submodular cost set cover games
From MaRDI portal
Cites work
- A course in game theory.
- A deep cut ellipsoid algorithm for convex programming: Theory and applications
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Approximate core allocations for edge cover games
- Balancedness of edge covering games
- Characterization of TU games with stable cores by nested balancedness
- Complexity of the Minimum Base Game on Matroids
- scientific article; zbMATH DE number 3139280 (Why is no real title available?)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 3733695 (Why is no real title available?)
- scientific article; zbMATH DE number 3750720 (Why is no real title available?)
- scientific article; zbMATH DE number 1953186 (Why is no real title available?)
- Maximization of nonsubmodular functions under multiple constraints with applications
- On some approximately balanced combinatorial cooperative games
- On the core and nucleolus of minimum cost spanning tree games
- On the core of linear production games
- Submodular function minimization
- Submodular Function Minimization under Covering Constraints
- Submodular functions and optimization.
- The general graph matching game: approximate core
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Totally Balanced Games and Games of Flow
This page was built for publication: Approximate cores of submodular cost set cover games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6936049)
