A polynomial-time method to compute all Nash equilibria solutions of a general two-person inspection game
From MaRDI portal
Publication:2028790
DOI10.1016/j.ejor.2020.06.032zbMath1487.91004OpenAlexW3037075071MaRDI QIDQ2028790
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.032
2-person games (91A05) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Related Items
Optimal strategies in the fighting fantasy gaming system: influencing stochastic dynamics by gambling with limited resource ⋮ Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise ⋮ A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications
Cites Work
- Unnamed Item
- Unnamed Item
- Multiple agents finitely repeated inspection game with dismissals
- Determining all Nash equilibria in a (bi-linear) inspection game
- The non-constant-sum Colonel Blotto game
- Evolutionary inspection and corruption games
- Mean field games. I: The stationary case
- An inspection game with multiple inspectees
- Corruption suppression models: the role of inspectors' moral level
- Mean field games
- Sequential, nonzero-sum ``Blotto: allocating defensive resources prior to attack
- Inspection games in arms control
- Contract design and the control of quality in a conflictual environment
- Incorporating monitoring technology and on-site inspections into an \(n\)-person inspection game
- Continuous patrolling and hiding games
- The lottery Blotto game
- Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle
- Playing for time: a sequential inspection game
- The Colonel Blotto game
- Network design and defence
- Patrolling Games
- Inspection games with local and global allocation bounds
- Recursive Inspection Games
- Security and Game Theory
- Systems defense games: Colonel blotto, command and control
- An infiltration game with time dependent payoff
- A remark on the customs and smuggler game
- The Evolutionary Game of Pressure (or Interference), Resistance and Collaboration
- Attack, Defence, and Contagion in Networks
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm
- Many Agent Games in Socio-economic Systems: Corruption, Inspection, Coalition Building, Network Growth, Security
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- A price leadership method for solving the inspector's non‐constant‐sum game
- A generalized inspection game
- The Theory of Play and Integral Equations with Skew Symmetric Kernels
- Timely inspection and deterrence
This page was built for publication: A polynomial-time method to compute all Nash equilibria solutions of a general two-person inspection game
