Sequential, nonzero-sum ``Blotto: allocating defensive resources prior to attack

DOI10.1016/J.GEB.2009.03.011zbMATH Open1189.91027OpenAlexW2105707743MaRDI QIDQ1036588FDOQ1036588

J. Blot

Publication date: 13 November 2009

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.geb.2009.03.011

zbMATH Keywords

defenseminmaxterrorismBlotto

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Noncooperative games (91A10) 2-person games (91A05) Multistage and repeated games (91A20)

Cites Work

• The Colonel Blotto game
• Systems defense games: Colonel blotto, command and control
• Discrete Colonel Blotto and general lotto games
• The Theory of Play and Integral Equations with Skew Symmetric Kernels
• Unilaterally competitive games
• Existence and Characterization of Perfect Equilibrium in Games of Perfect Information
• Almost Strictly Competitive Games
• Distributive politics and electoral competition
• Pure strategy equilibria in a class of systems defense games
• Title not available (Why is that?)

Cited In (16)

• A review of attacker-defender games: current state and paths forward
• Hybrid defensive resource allocations in the face of partially strategic attackers in a sequential defender-attacker game
• Discrete Colonel Blotto games with two battlefields
• Pure strategy Nash equilibrium in 2-contestant generalized lottery Colonel Blotto games
• Fighting terrorism: how to position rapid response teams?
• A lottery Blotto game with heterogeneous items of asymmetric valuations
• Stackelberg production-protection games: defending crop production against intentional attacks
• Risk evaluation and games in mine warfare considering shipcounter effects
• A polynomial-time method to compute all Nash equilibria solutions of a general two-person inspection game
• Waging simple wars: a complete characterization of two-battlefield Blotto equilibria
• ON THE IMPOSSIBILITY OF DETERRENCE IN SEQUENTIAL COLONEL BLOTTO GAMES
• Modeling costly learning and counter-learning in a defender-attacker game with private defender information
• Buying winners
• A Colonel Blotto gladiator game
• Bidding games and efficient allocations
• Static search games played over graphs and general metric spaces

This page was built for publication: Sequential, nonzero-sum ``Blotto: allocating defensive resources prior to attack

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1036588)