English
Related papers

Related papers: Strategic investments in multi-stage General Lotto…

200 papers

Strategic decisions are often made over multiple periods of time, wherein decisions made earlier impact a competitor's success in later stages. In this paper, we study these dynamics in General Lotto games, a class of models describing the…

Computer Science and Game Theory · Computer Science 2025-05-06 Keith Paarporn , Rahul Chandan , Mahnoosh Alizadeh , Jason R. Marden

Strategic decision-making in uncertain and adversarial environments is crucial for the security of modern systems and infrastructures. A salient feature of many optimal decision-making policies is a level of unpredictability, or randomness,…

Computer Science and Game Theory · Computer Science 2024-05-03 Keith Paarporn , Rahul Chandan , Dan Kovenock , Mahnoosh Alizadeh , Jason R. Marden

The allocation of resources plays an important role in the completion of system objectives and tasks, especially in the presence of strategic adversaries. Optimal allocation strategies are becoming increasingly more complex, given that…

Theoretical Economics · Economics 2025-05-07 Keith Paarporn , Adel Aghajan , Jason R. Marden

Can revealing one's competitive capabilities to an opponent offer strategic benefits? In this paper, we address this question in the context of General Lotto games, a class of two-player competitive resource allocation models. We consider…

Computer Science and Game Theory · Computer Science 2023-04-07 Keith Paarporn , Philip N. Brown

The General Lotto game is a popular variant of the famous Colonel Blotto game, in which two opposing players allocate limited resources over many battlefields. In this paper, we consider incomplete and asymmetric information formulations…

Computer Science and Game Theory · Computer Science 2022-10-18 Keith Paarporn , Rahul Chandan , Mahnoosh Alizadeh , Jason R. Marden

Resource allocation problems across multiple contests are ubiquitous in adversarial settings, from military operations to market competition. While Colonel Blotto and General Lotto games have provided valuable theoretical foundations for…

Computer Science and Game Theory · Computer Science 2026-04-09 Keith Paarporn , Jason R. Marden

How do different alliance mechanisms compare? In this work, we analyze various methods of forming an alliance in the Coalitional General Lotto game, a simple model of competitive resource allocation. In the game, Players 1 and 2…

Computer Science and Game Theory · Computer Science 2026-01-30 Vade Shah , Jason R. Marden

In this paper, we investigate the multiplayer General Lotto game across multiple battlefields, a significant variant of the Colonel Blotto game. In this version, each player employs a probability distribution for resource allocation,…

Computer Science and Game Theory · Computer Science 2025-10-07 Yan Liu , Bonan Ni , Weiran Shen , Zihe Wang , Jie Zhang

We introduce General Lotto games with Scouts: a General Lotto game with asymmetric information. There are two players, Red and Blue, who both allocate resources to a field. However, scouting capabilities afford Blue to gain information,…

Computer Science and Game Theory · Computer Science 2024-04-10 Jan-Tino Brethouwer , Bart van Ginkel , Roy Lindelauf

Resource allocation in adversarial environments is a fundamental challenge across various domains, from corporate competition to military strategy. This article examines the impact of compromising an opponent's strategic intent in the…

Computer Science and Game Theory · Computer Science 2024-10-03 Gilberto Diaz-Garcia , Keith Paarporn , Jason R. Marden

In competitive resource allocation formulations multiple agents compete over different contests by committing their limited resources in them. For these settings, contest games offer a game-theoretic foundation to analyze how players can…

Computer Science and Game Theory · Computer Science 2024-08-05 Gilberto Diaz-Garcia , Francesco Bullo , Jason R. Marden

In competitive adversarial environments, it is often advantageous to obfuscate one's strategies or capabilities. However, revealing one's strategic intentions may shift the dynamics of the competition in complex ways. Can it ever be…

Computer Science and Game Theory · Computer Science 2020-03-17 Rahul Chandan , Keith Paarporn , Jason R. Marden

Ensuring the security of networked systems is a significant problem, considering the susceptibility of modern infrastructures and technologies to adversarial interference. A central component of this problem is how defensive resources…

Computer Science and Game Theory · Computer Science 2023-06-13 Adel Aghajan , Keith Paarporn , Jason R. Marden

We introduce the concept of budget games. Players choose a set of tasks and each task has a certain demand on every resource in the game. Each resource has a budget. If the budget is not enough to satisfy the sum of all demands, it has to…

Computer Science and Game Theory · Computer Science 2014-07-14 Maximilian Drees , Sören Riechers , Alexander Skopalik

A variety of social, economic, and political interactions have long been modelled after Blotto games. In this paper, we introduce a general model of dynamic $n$-player Blotto contests. The players have asymmetric resources, and the…

Theoretical Economics · Economics 2022-07-27 Nejat Anbarcı , Kutay Cingiz , Mehmet S. Ismail

We consider the problem of budget allocation for competitive influence maximization over social networks. In this problem, multiple competing parties (players) want to distribute their limited advertising resources over a set of social…

Computer Science and Game Theory · Computer Science 2021-08-31 S. Rasoul Etesami

In this paper, we investigate informational asymmetries in the Colonel Blotto game, a game-theoretic model of competitive resource allocation between two players over a set of battlefields. The battlefield valuations are subject to…

Computer Science and Game Theory · Computer Science 2025-05-06 Keith Paarporn , Rahul Chandan , Mahnoosh Alizadeh , Jason R. Marden

In competitive resource allocation environments, agents often choose to form alliances; however, for some agents, doing so may not always be beneficial. Is there a method of forming alliances that always reward each of their members? We…

Computer Science and Game Theory · Computer Science 2024-10-17 Vade Shah , Jason R. Marden

We consider an extension of strategic normal form games with a phase of negotiations before the actual play of the game, where players can make binding offers for transfer of utilities to other players after the play of the game, in order…

Computer Science and Game Theory · Computer Science 2013-11-19 Valentin Goranko , Paolo Turrini

Competitive resource allocation between adversarial decision makers arises in a wide spectrum of real-world applications such as in communication systems, cyber-physical systems security, as well as financial, political, and electoral…

Computer Science and Game Theory · Computer Science 2018-03-05 Aidin Ferdowsi , Anibal Sanjab , Walid Saad , Tamer Başar
‹ Prev 1 2 3 10 Next ›