Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
From MaRDI portal
Publication:2064296
Recommendations
Cites work
- scientific article; zbMATH DE number 3139280 (Why is no real title available?)
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 1302174 (Why is no real title available?)
- A new approach to the maximum-flow problem
- A note on two problems in connexion with graphs
- Algorithmic Cooperative Game Theory
- An algorithm for finding the nucleolus of assignment games
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Computing the nucleolus of min-cost spanning tree games is NP-hard.
- Cores of convex games
- Deterministic network interdiction
- Finding nucleolus of flow game
- Matching Games: The Least Core and the Nucleolus
- Network flows. Theory, algorithms, and applications.
- On Noncooperative Games, Minimax Theorems, and Equilibrium Problems
- On the Complexity of Cooperative Solution Concepts
- Shortest-path network interdiction
- The Nucleolus of a Characteristic Function Game
- The kernel/nucleolus of a standard tree game
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- The nucleolus of balanced simple flow networks
- Totally Balanced Games and Games of Flow
This page was built for publication: Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064296)