Introduces Deception Stackelberg equilibria (DSE) and Hyper Nash equilibria (HNE) for three-party deception games, provides consistency conditions between them, and a convergent hypergradient algorithm for computation, applied to wireless security and false data injection defense.
Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs
3 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
An inexact subgradient algorithm achieves O(ε^{-2}) iteration complexity for ε-accurate solutions to copositive programs while allowing inexact solves of NP-hard quadratic subproblems and providing a sufficient condition for non-complete positivity.
A modified golden ratio proximal algorithm solves pseudomonotone equilibrium problems with explicit steplengths, proven convergence, and R-linear rate under strong pseudomonotonicity.
citing papers explorer
-
Deception Equilibrium Analysis for Three-Party Stackelberg Game with Insider
Introduces Deception Stackelberg equilibria (DSE) and Hyper Nash equilibria (HNE) for three-party deception games, provides consistency conditions between them, and a convergent hypergradient algorithm for computation, applied to wireless security and false data injection defense.
-
Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
An inexact subgradient algorithm achieves O(ε^{-2}) iteration complexity for ε-accurate solutions to copositive programs while allowing inexact solves of NP-hard quadratic subproblems and providing a sufficient condition for non-complete positivity.
-
Modified golden ratio algorithms for solving equilibrium problems
A modified golden ratio proximal algorithm solves pseudomonotone equilibrium problems with explicit steplengths, proven convergence, and R-linear rate under strong pseudomonotonicity.