Equilibrium strategies for multiple interdictors on a common network
From MaRDI portal
Publication:2028891
DOI10.1016/j.ejor.2020.06.002zbMath1487.91007OpenAlexW3035357653MaRDI QIDQ2028891
Shreyas Sundaram, Ashish R. Hota, Harikrishnan Sreekumaran, Nelson A. Uhan, Andrew L. Liu
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.06.002
Noncooperative games (91A10) Games involving graphs (91A43) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Deterministic network models in operations research (90B10)
Related Items
Perspectives on how to conduct responsible anti-human trafficking research in operations and analytics ⋮ Magnitude of inefficiency
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimizing dynamic investment decisions for railway systems protection
- Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
- Designing robust coverage networks to hedge against worst-case facility losses
- Restricted generalized Nash equilibria and controlled penalty algorithm
- Decomposition algorithms for generalized potential games
- Selfish load balancing and atomic congestion games
- Generalized Nash games and quasi-variational inequalities
- Interfaces to PATH 3.0: Design, implementation and usage
- Deterministic network interdiction
- Revisiting a game theoretic framework for the robust railway network design against intentional attacks
- Some projection-like methods for the generalized Nash equilibria
- Exact and heuristic algorithms for solving the generalized minimum filter placement problem
- A globalized Newton method for the computation of normalized Nash equilibria
- On intrinsic complexity of Nash equilibrium problems and bilevel optimization
- An exact solution approach for the interdiction median problem with fortification
- How much can taxes help selfish routing?
- A class of games possessing pure-strategy Nash equilibria
- On generalized Nash games and variational inequalities
- On a network creation game
- Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
- Efficiency of Scalar-Parameterized Mechanisms
- Interdicting a Nuclear-Weapons Project
- How bad is selfish routing?
- The Linear Complementarity Problem
- The Price of Stability for Network Design with Fair Cost Allocation
- On nash equilibria for a network creation game
- Global Optimization Approach to the Linear Complementarity Problem
- Maximizing the minimum source-sink path subject to a budget constraint
- On relaxation algorithms in computation of noncooperative equilibria
- Variational Analysis
- Shortest-path network interdiction
- Two-Person Zero-Sum Games for Network Interdiction
- The price of selfish behavior in bilateral network formation
- Algorithms – ESA 2005
- Bimatrix Equilibrium Points and Mathematical Programming
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Optimal interdiction policy for a flow network
- The Linear Complementarity Problem
- Efficiency Loss in a Network Resource Allocation Game
- Selfish Routing in Capacitated Networks
- A Social Equilibrium Existence Theorem*
- Generalized Nash equilibrium problems
- The Price of Routing Unsplittable Flow
- Refinements of the Nash equilibrium concept
- On the history of the transportation and maximum flow problems
- Generalized Nash equilibrium problems
