scholarly journals The Non-Constant-Sum Colonel Blotto Game

2008 ◽  
Author(s):  
Brian Roberson ◽  
Dmitriy Kvasov
Keyword(s):  
Blotto Game ◽  
Colonel Blotto ◽  
Colonel Blotto Game

scholarly journals The non-constant-sum Colonel Blotto game

2011 ◽  
Vol 51 (2) ◽  
pp. 397-433 ◽  
Author(s):  
Brian Roberson ◽  
Dmitriy Kvasov
Keyword(s):  
Blotto Game ◽  
Colonel Blotto ◽  
Colonel Blotto Game

The Colonel Blotto game

2006 ◽  
Vol 29 (1) ◽  
pp. 1-24 ◽  
Author(s):  
Brian Roberson
Keyword(s):  
Blotto Game ◽  
Colonel Blotto ◽  
Colonel Blotto Game

scholarly journals Privacy-Aware Laser Wireless Power Transfer for Aerial Multi-Access Edge Computing: A Colonel Blotto Game Approach

2021 ◽  
Author(s):  
Long Zhang ◽  
Yao Wang ◽  
Minghui Min ◽  
Chao Guo ◽  
Vishal Sharma ◽  
...  
Keyword(s):  
Location Privacy ◽  
Wireless Power Transfer ◽  
Edge Computing ◽  
Power Transfer ◽  
Wireless Power ◽  
Battery Lifetime ◽  
Blotto Game ◽  
Colonel Blotto ◽  
Colonel Blotto Game ◽  
Multi Access

Multi-access edge computing (MEC) has been recently considered in challenging environments lacking available terrestrial infrastructures by extending the computing resources to the air for further enhancing the computation capability of the new aerial user equipment (AUE). Additionally, wireless power transfer (WPT) is a promising solution to prolong the battery lifetime of energy-constrained wireless devices like AUEs. In this paper, we investigate the integration of laser-beamed WPT in the high-altitude platform (HAP) aided MEC systems for the HAP-connected AUEs. By discretizing the three-dimensional coverage space of the HAP, we present a multi-tier tile grid-based spatial structure to provide aerial locations for laser charging. With this setup, we identify a new privacy vulnerability caused by the openness during the air-to-air transmission of WPT signaling messages in the presence of a terrestrial adversary. A privacy-aware laser-powered aerial MEC framework is developed that addresses this vulnerability and enhances the location privacy of AUEs for laser WPT. Specifically, the interaction between the HAP as a defender and the adversary in their tile grid allocation as charging locations to AUEs is formulated as a Colonel Blotto game, which models the competition of the players for limited resources over multiple battlefields for a finite time horizon. Moreover, we derive the mixed-strategy Nash equilibria of the tile grid allocation game for both symmetric and asymmetric tile grids between the defender and the adversary. Simulations results show that the proposed framework significantly outperforms the design baselines with a given privacy protection level in terms of system-wide expected total utilities.

A sequential Colonel Blotto game with a sensor network

2012 ◽  
Author(s):  
Z. E. Fuchs ◽  
P. P. Khargonekar
Keyword(s):  
Sensor Network ◽  
Blotto Game ◽  
Colonel Blotto ◽  
Colonel Blotto Game

Privacy-Aware Wireless Power Transfer for Aerial Computation Offloading via Colonel Blotto Game

2020 ◽  
Author(s):  
Yao Wang ◽  
Long Zhang ◽  
Minghui Min ◽  
Chao Guo ◽  
Vishal Sharma ◽  
...  
Keyword(s):  
Wireless Power Transfer ◽  
Computation Offloading ◽  
Power Transfer ◽  
Wireless Power ◽  
Blotto Game ◽  
Colonel Blotto ◽  
Colonel Blotto Game

scholarly journals Privacy-Aware Wireless Power Transfer for Aerial Computation Offloading via Colonel Blotto Game

2020 ◽  
Author(s):  
Yao Wang ◽  
Long Zhang ◽  
Minghui Min ◽  
Chao Guo ◽  
Vishal Sharma ◽  
...  
Keyword(s):  
Laser Energy ◽  
Wireless Power Transfer ◽  
Computation Offloading ◽  
Power Transfer ◽  
Wireless Power ◽  
Blotto Game ◽  
Mixed Strategy Nash Equilibrium ◽  
Colonel Blotto ◽  
Colonel Blotto Game ◽  
Finite Time Horizon

In this paper, a laser-powered aerial mobile edge computing (MEC) architecture is proposed, where a high-altitude platform (HAP) integrated with an MEC server transfers laser energy to charge aerial user equipments (AUEs) for offloading their computation tasks to the HAP. Particularly, we identify a new privacy vulnerability caused by the transmission of wireless power transfer (WPT) signaling in the presence of a malicious smart attacker (SA). To address this vulnerability, the interaction between the HAP and the SA in their allocation of tile grids as charging points to the AUEs in laser-enabled WPT is formulated as a Colonel Blotto game (CBG), which models the competition of two players for limited resources over multiple battlefields for a finite time horizon. Moreover, the utility function that each player receives over a battlefield is developed by identifying the tradeoff between privacy protection level and energy consumption of each AUE. We further obtain the mixed-strategy Nash equilibrium for the modified CBG with asymmetric players. Simulation results are presented to show the effectiveness of this game framework.

scholarly journals Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games

2018 ◽  
Author(s):  
Dong Quan Vu ◽  
Patrick Loiseau ◽  
Alonso Silva
Keyword(s):  
Dynamic Programming Algorithm ◽  
Approximation Error ◽  
Programming Algorithm ◽  
Discrete Version ◽  
Efficient Computation ◽  
Continuous Version ◽  
Blotto Game ◽  
Colonel Blotto ◽  
Colonel Blotto Game ◽  
Colonel Blotto Games

The Colonel Blotto game is a famous game commonly used to model resource allocation problems in many domains ranging from security to advertising. Two players distribute a fixed budget of resources on multiple battlefields to maximize the aggregate value of battlefields they win, each battlefield being won by the player who allocates more resources to it. The continuous version of the game---where players can choose any fractional allocation---has been extensively studied, albeit only with partial results to date. Recently, the discrete version---where allocations can only be integers---started to gain traction and algorithms were proposed to compute the equilibrium in polynomial time; but these remain computationally impractical for large (or even moderate) numbers of battlefields. In this paper, we propose an algorithm to compute very efficiently an approximate equilibrium for the discrete Colonel Blotto game with many battlefields. We provide a theoretical bound on the approximation error as a function of the game's parameters. We also propose an efficient dynamic programming algorithm in order to compute for each game instance the actual value of the error. We perform numerical experiments that show that the proposed strategy provides a fast and good approximation to the equilibrium even for moderate numbers of battlefields

Sign in / Sign up

Export Citation Format

Share Document