Algorithms for a risk-averse Stackelberg game with multiple adversaries

DOI10.1016/j.cor.2023.106367OpenAlexW4285773783MaRDI QIDQ6068695

Fernando Ordóñez, Renaud Chicoisne

Publication date: 13 November 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106367

zbMATH Keywords

decompositionquantal responsepiecewise linear approximationentropic risk measurerisk averse optimizationStackelberg security games

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimistic MILP modeling of non-linear optimization problems
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Robust solutions to Stackelberg games: addressing bounded rationality and limited observations in human cognition
• Partitioning procedures for solving mixed-variables programming problems
• A bilevel fixed charge location model for facilities under imminent attack
• Quantal response equilibria for normal form games
• A Benders decomposition algorithm for the maximum availability service facility location problem
• A bilevel mixed-integer program for critical infrastructure protection planning
• Risk Averse Stackelberg Security Games with Quantal Response
• Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
• A Cognitive Hierarchy Model of Games
• Game-Theoretic Patrolling with Dynamic Execution Uncertainty and a Case Study on a Real Transit System
• Risk Aversion in the Small and in the Large
• Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
• A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem

This page was built for publication: Algorithms for a risk-averse Stackelberg game with multiple adversaries