Algorithmic Cooperative Game Theory
From MaRDI portal
Recommendations
Cited in
(23)- The complexity of egalitarian mechanisms for linear programming games
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
- Computing Shapley values in the plane
- Network strength games: the core and the nucleolus
- Gain-sharing in urban consolidation centers
- Universally balanced combinatorial optimization games
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
- On the complexity of nucleolus computation for bipartite \(b\)-matching games
- Computational Aspects of Cooperative Game Theory
- Computing near-optimal stable cost allocations for cooperative games by Lagrangian relaxation
- LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES
- scientific article; zbMATH DE number 444986 (Why is no real title available?)
- Encouraging Cooperation in Sharing Supermodular Costs
- Algorithmic Game Theory: A Snapshot
- A formal theory of cooperative TU-games
- SIMPLICIAL ALGORITHM FOR COMPUTING A CORE ELEMENT IN A BALANCED GAME
- On the Complexity of Cooperative Solution Concepts
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- scientific article; zbMATH DE number 7559220 (Why is no real title available?)
- A solution concept related to ``bounded rationality for some two-echelon models
- Relaxed core stability in hedonic games
- Social exchange networks with distant bargaining
- Computing the cores of strategic games with punishment-dominance relations
This page was built for publication: Algorithmic Cooperative Game Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528695)