Network disconnection games: a game theoretic approach to checkpoint evaluation in networks

DOI10.1016/j.dam.2020.05.008zbMath1479.91059OpenAlexW3035681296MaRDI QIDQ2064296

Francisco Barahona, Mourad Baïou

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

zbMATH Keywords

cooperative gamesnetwork flowsnucleolus

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The nucleolus of balanced simple flow networks
• An algorithm for finding the nucleolus of assignment games
• Deterministic network interdiction
• The kernel/nucleolus of a standard tree game
• Computing the nucleolus of min-cost spanning tree games is NP-hard.
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• Cores of convex games
• On Noncooperative Games, Minimax Theorems, and Equilibrium Problems
• Algorithmic Cooperative Game Theory
• A new approach to the maximum-flow problem
• Totally Balanced Games and Games of Flow
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• On the Complexity of Cooperative Solution Concepts
• Shortest-path network interdiction
• The Nucleolus of a Characteristic Function Game
• Matching Games: The Least Core and the Nucleolus
• Finding nucleolus of flow game

This page was built for publication: Network disconnection games: a game theoretic approach to checkpoint evaluation in networks