Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
From MaRDI portal
Publication:2064296
DOI10.1016/J.DAM.2020.05.008zbMATH Open1479.91059OpenAlexW3035681296MaRDI QIDQ2064296FDOQ2064296
Authors: Mourad Baïou, Francisco Barahona
Publication date: 5 January 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.05.008
Recommendations
Cites Work
- Network flows. Theory, algorithms, and applications.
- A note on two problems in connexion with graphs
- The Nucleolus of a Characteristic Function Game
- Title not available (Why is that?)
- An algorithm for finding the nucleolus of assignment games
- The kernel/nucleolus of a standard tree game
- Cores of convex games
- Title not available (Why is that?)
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- The nucleolus of balanced simple flow networks
- Deterministic network interdiction
- A new approach to the maximum-flow problem
- Totally Balanced Games and Games of Flow
- On the Complexity of Cooperative Solution Concepts
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- Shortest-path network interdiction
- Finding nucleolus of flow game
- Matching Games: The Least Core and the Nucleolus
- Computing the nucleolus of min-cost spanning tree games is NP-hard.
- Title not available (Why is that?)
- Algorithmic Cooperative Game Theory
- On Noncooperative Games, Minimax Theorems, and Equilibrium Problems
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)