中文
相关论文

相关论文: Allocation of Heterogeneous Resources in General L…

200 篇论文

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…

计算机科学与博弈论 · 计算机科学 2025-05-06 Keith Paarporn , Rahul Chandan , Mahnoosh Alizadeh , Jason R. Marden

In adversarial interactions, one is often required to make strategic decisions over multiple periods of time, wherein decisions made earlier impact a player's competitive standing as well as how choices are made in later stages. In this…

计算机科学与博弈论 · 计算机科学 2022-09-14 Rahul Chandan , Keith Paarporn , Mahnoosh Alizadeh , Jason R. Marden

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…

计算机科学与博弈论 · 计算机科学 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…

计算机科学与博弈论 · 计算机科学 2026-04-09 Keith Paarporn , 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,…

计算机科学与博弈论 · 计算机科学 2024-05-03 Keith Paarporn , Rahul Chandan , Dan Kovenock , Mahnoosh Alizadeh , 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…

计算机科学与博弈论 · 计算机科学 2026-01-30 Vade Shah , Jason R. Marden

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…

理论经济学 · 经济学 2022-07-27 Nejat Anbarcı , Kutay Cingiz , Mehmet S. Ismail

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…

计算机科学与博弈论 · 计算机科学 2023-04-07 Keith Paarporn , Philip N. Brown

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…

计算机科学与博弈论 · 计算机科学 2023-06-13 Adel Aghajan , Keith Paarporn , Jason R. Marden

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,…

计算机科学与博弈论 · 计算机科学 2024-04-10 Jan-Tino Brethouwer , Bart van Ginkel , Roy Lindelauf

Blotto Games are a popular model of multi-dimensional strategic resource allocation. Two players allocate resources in different battlefields in an auction setting. While competition with equal budgets is well understood, little is known…

神经与进化计算 · 计算机科学 2021-03-29 Aymeric Vie

We show that, in a resource allocation problem, the ex ante aggregate utility of players with cumulative-prospect-theoretic preferences can be increased over deterministic allocations by implementing lotteries. We formulate an optimization…

理论经济学 · 经济学 2020-12-07 Soham R. Phade , Venkat Anantharam

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…

计算机科学与博弈论 · 计算机科学 2024-10-03 Gilberto Diaz-Garcia , 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…

计算机科学与博弈论 · 计算机科学 2014-07-14 Maximilian Drees , Sören Riechers , Alexander Skopalik

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,…

计算机科学与博弈论 · 计算机科学 2025-10-07 Yan Liu , Bonan Ni , Weiran Shen , Zihe Wang , Jie Zhang

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…

计算机科学与博弈论 · 计算机科学 2018-03-05 Aidin Ferdowsi , Anibal Sanjab , Walid Saad , Tamer Başar

The strategic selection of resources by selfish agents is a classic research direction, with Resource Selection Games and Congestion Games as prominent examples. In these games, agents select available resources and their utility then…

计算机科学与博弈论 · 计算机科学 2024-06-14 Jonathan Gadea Harder , Simon Krogmann , Pascal Lenzner , Alexander Skopalik

In order to understand if and how strategic resource allocation can constrain the structure of pair-wise competition outcomes in competitive human competitions we introduce a new multiplayer resource allocation game, the Population Lotto…

计算机科学与博弈论 · 计算机科学 2022-09-02 Giovanni Artiglio , Aiden Youkhana , Joel Nishimura

We study $n$-dimensional contests between two players with heterogeneous effort costs, where each dimension (battle) is modeled as a Tullock contest. Prize-allocation rules are identity-independent, budget-balanced, and weakly increasing in…

理论经济学 · 经济学 2026-03-31 Siyuan Fan , Zhonghong Kuang , Jingfeng Lu

In the Colonel Blotto game, two players with a fixed budget simultaneously allocate their resources across n battlefields to maximize the aggregate value gained from the battlefields where they have the higher allocation. Despite its…

计算机科学与博弈论 · 计算机科学 2020-11-04 Dong Quan Vu , Patrick Loiseau , Alonso Silva
‹ 上一页 1 2 3 10 下一页 ›