Equilibrium strategies for multiple interdictors on a common network
type: Item
instance of: scholarly article
title: Equilibrium strategies for multiple interdictors on a common network
zbMATH Open document ID: 1487.91007
author: Harikrishnan Sreekumaran
author: Ashish R. Hota
author: Andrew L. Liu
author: Nelson A. Uhan
author: Shreyas Sundaram
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 7354099
zbMATH Keywords: multi-agent systems
zbMATH Keywords: interdiction
zbMATH Keywords: game theory
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: price of anarchy
describes a project that uses: PATH Solver
describes a project that uses: GitHub
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ejor.2020.06.002
OpenAlex ID: W3035357653
cites work: On nash equilibria for a network creation game
cites work: The Price of Stability for Network Design with Fair Cost Allocation
cites work: The Price of Routing Unsplittable Flow
cites work: Q4793405
cites work: Q4821526
cites work: Interdicting a Nuclear-Weapons Project
cites work: Algorithms – ESA 2005
cites work: How much can taxes help selfish routing?
cites work: The price of selfish behavior in bilateral network formation
cites work: Selfish Routing in Capacitated Networks
cites work: The Linear Complementarity Problem
cites work: A Social Equilibrium Existence Theorem*
cites work: On intrinsic complexity of Nash equilibrium problems and bilevel optimization
cites work: A globalized Newton method for the computation of normalized Nash equilibria
cites work: On a network creation game
cites work: On generalized Nash games and variational inequalities
cites work: Generalized Nash equilibrium problems
cites work: Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
cites work: Decomposition algorithms for generalized potential games
cites work: Interfaces to PATH 3.0: Design, implementation and usage
cites work: Restricted generalized Nash equilibria and controlled penalty algorithm
cites work: Maximizing the minimum source-sink path subject to a budget constraint
cites work: Optimal interdiction policy for a flow network
cites work: Generalized Nash games and quasi-variational inequalities
cites work: Shortest-path network interdiction
cites work: Efficiency Loss in a Network Resource Allocation Game
cites work: Efficiency of Scalar-Parameterized Mechanisms
cites work: Q3409969
cites work: Bimatrix Equilibrium Points and Mathematical Programming
cites work: Exact and heuristic algorithms for solving the generalized minimum filter placement problem
cites work: Refinements of the Nash equilibrium concept
cites work: Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
cites work: Designing robust coverage networks to hedge against worst-case facility losses
cites work: Global Optimization Approach to the Linear Complementarity Problem
cites work: Revisiting a game theoretic framework for the robust railway network design against intentional attacks
cites work: Variational Analysis
cites work: Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: How bad is selfish routing?
cites work: An exact solution approach for the interdiction median problem with fortification
cites work: Q4221106
cites work: On the history of the transportation and maximum flow problems
cites work: Q3528714
cites work: Optimizing dynamic investment decisions for railway systems protection
cites work: Selfish load balancing and atomic congestion games
cites work: On relaxation algorithms in computation of noncooperative equilibria
cites work: Two-Person Zero-Sum Games for Network Interdiction
cites work: Deterministic network interdiction
cites work: Some projection-like methods for the generalized Nash equilibria
DOI: 10.1016/J.EJOR.2020.06.002
Recommended article: An interdiction game on a queueing network with multiple intruders
Recommended article: A game-theoretic approach to network equilibrium

Equilibrium strategies for multiple interdictors on a common network (Recommended article)
Recommended article: Equilibrium strategies for a tandem network under partial information
Similarity Score: 0.8644748
Recommender Run: Recommender Run 2

Equilibrium strategies for multiple interdictors on a common network (Recommended article)
Recommended article: Equilibrium games in networks
Similarity Score: 0.86087734
Recommender Run: Recommender Run 2

Equilibrium strategies for multiple interdictors on a common network (Recommended article)
Recommended article: Equilibria in Networks
Similarity Score: 0.85459673
Recommender Run: Recommender Run 2

Equilibrium strategies for multiple interdictors on a common network (Recommended article)
Recommended article: Multiple Equilibrium Behaviors on Networks
Similarity Score: 0.85255444
Recommender Run: Recommender Run 2

Equilibrium strategies for multiple interdictors on a common network (Recommended article)
Recommended article: Network interdiction and stochastic integer programming
Similarity Score: 0.8491966
Recommender Run: Recommender Run 2

Equilibrium strategies for multiple interdictors on a common network (Recommended article)
Recommended article: Heuristics for multi-stage interdiction of stochastic networks
Similarity Score: 0.84470725
Recommender Run: Recommender Run 2

Equilibrium strategies for multiple interdictors on a common network (Recommended article)
Recommended article: Q4452914
Similarity Score: 0.8419608
Recommender Run: Recommender Run 2