Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
From MaRDI portal
Publication:2044489
DOI10.1007/s10589-021-00282-7zbMath1470.91015arXiv2002.12599OpenAlexW3165447870MaRDI QIDQ2044489
Giampaolo Liuzzi, Marco Locatelli, Stefan Rass, Veronica Piccialli
Publication date: 9 August 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.12599
Noncooperative games (91A10) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) 2-person games (91A05)
Related Items
A computational study on QP problems with general linear constraints ⋮ (Global) optimization: historical notes and recent developments ⋮ An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Decision and game theory for security. 7th international conference, GameSec 2016, New York, NY, USA, November 2--4, 2016. Proceedings
- Three enhancements for optimization-based bound tightening
- Decision and game theory for security. First international conference, GameSec 2010, Berlin, Germany, November 22--23, 2010. Proceedings
- Cyber-security in critical infrastructures. A game-theoretic approach
- Quadratic programming with one negative eigenvalue is NP-hard
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Security from the adversary's inertia-controlling convergence speed when playing mixed strategy equilibria
- On the cost of game playing: how to control the expenses in mixed strategies
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- BARON: A general purpose global optimization software package
- Global optimization problems and domain reduction strategies
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- QPLIB: a library of quadratic programming instances
- Numerical Computation of Multi-goal Security Strategies
- Protecting Moving Targets with Multiple Mobile Resources
- Patrolling Games
- Patrolling a Border
- Julia: A Fresh Approach to Numerical Computing
- Security and Game Theory
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Exact algorithms for solving stochastic games
