A Three-Stage Colonel Blotto Game with Applications to Cyber-Physical Security

Abstract

We consider a three-step three-player complete information Colonel Blotto game in this paper, in which the first two players fight against a common adversary. Each player is endowed with certain amount of resources at the beginning of the game, and the number of battlefields on which a player and the adversary fights is specified. The first two players are allowed to form a coalition if it improves their payoffs. In the first stage, the first two players may add battlefields and incur costs. In the second stage, the first two players may transfer resources among each other. The adversary observes this transfer, and decides on the allocation of its resources to the two battles with the players.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 15, 2014
Accession Number
ADA604916

Entities

People

  • Abhishek Gupta
  • Cedric Langbort
  • Galina Schwartz
  • S. Shankar Sastry
  • Tamer Başar

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Cyber

DTIC Thesaurus Topics

  • Algorithms
  • Battlefields
  • Computer Science
  • Cyber-Physical Systems
  • Electrical Engineering
  • Engineering
  • Hard Copy
  • Information Operations
  • Intervals
  • Mathematics
  • Notation
  • Numbers
  • Physical Security
  • Probability
  • Random Variables
  • Real Numbers
  • Security

Fields of Study

  • Economics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Game Theory.
  • Military Training and Readiness Simulation

Technology Areas

  • Cyber