Allocation of Heterogeneous Resources in General Lotto Games

• URL: http://arxiv.org/abs/2505.02860v1
• Date: Fri, 02 May 2025 23:26:10 GMT
• Title: Allocation of Heterogeneous Resources in General Lotto Games
• Authors: Keith Paarporn, Adel Aghajan, Jason R. Marden,
• Abstract summary: We focus on deriving optimal strategies for the allocation of heterogeneous resources in a well-known competitive resource allocation model known as the General Lotto game.<n>In standard formulations, outcomes are determined solely by the players' allocation strategies of a common, single type of resource across multiple contests.<n>Here, we propose a multi-resource extension where the winner of a contest is now determined not only by the amount of resources allocated, but also by the composition of resource types that are allocated.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 multiple heterogeneous types of resources are at a system planner's disposal. In this paper, we focus on deriving optimal strategies for the allocation of heterogeneous resources in a well-known competitive resource allocation model known as the General Lotto game. In standard formulations, outcomes are determined solely by the players' allocation strategies of a common, single type of resource across multiple contests. In particular, a player wins a contest if it sends more resources than the opponent. Here, we propose a multi-resource extension where the winner of a contest is now determined not only by the amount of resources allocated, but also by the composition of resource types that are allocated. We completely characterize the equilibrium payoffs and strategies for two distinct formulations. The first consists of a weakest-link/best-shot winning rule, and the second considers a winning rule based on a weighted linear combination of the allocated resources. We then consider a scenario where the resource types are costly to purchase, and derive the players' equilibrium investments in each of the resource types.

Related papers

• No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need! [56.80767500991973]
  We focus on two canonical settings: $(i)$ online resource allocation where rewards and costs are observed before action selection, and $(ii)$ online learning with resource constraints where they are observed after action selection, under full feedback or bandit feedback.<n>It is well known that achieving sublinear regret in these settings is impossible when reward and cost distributions may change arbitrarily over time.<n>We design general (primal-)dual methods that achieve sublinear regret with respect to baselines that follow the spending plan. Crucially, the performance of our algorithms improves when the spending plan ensures a well-balanced distribution of the budget
  arXiv  Detail & Related papers  (2025-06-16T08:42:31Z)
• Reinforcement Learning for Game-Theoretic Resource Allocation on Graphs [9.369330148791201]
  Game-theoretic resource allocation on graphs (GRAG) is a problem modeled as a multi-step Colonel Blotto Game (MCBG)<n>We formulate the MCBG as a Markov Decision Process (MDP) and apply Reinforcement Learning (RL) methods, specifically Deep Q-Network (DQN) and Proximal Policy Optimization (PPO)<n>We evaluate RL performance across a variety of graph structures and initial resource distributions, comparing against random, greedy, and learned RL policies.
  arXiv  Detail & Related papers  (2025-05-08T21:12:34Z)
• ALYMPICS: LLM Agents Meet Game Theory -- Exploring Strategic Decision-Making with AI Agents [77.34720446306419]
  Alympics is a systematic simulation framework utilizing Large Language Model (LLM) agents for game theory research. Alympics creates a versatile platform for studying complex game theory problems.
  arXiv  Detail & Related papers  (2023-11-06T16:03:46Z)
• Strategic Resource Selection with Homophilic Agents [48.83208975886834]
  We propose Resource Selection Games with heterogeneous agents that strive for joint resource usage with similar agents. Our model considers agents with different types and the decisive feature is the fraction of same-type agents among the users. We show that this type of bounded rationality yields favorable game-theoretic properties.
  arXiv  Detail & Related papers  (2023-05-01T14:14:58Z)
• ApproxED: Approximate exploitability descent via learned best responses [61.17702187957206]
  We study the problem of finding an approximate Nash equilibrium of games with continuous action sets. We propose two new methods that minimize an approximation of exploitability with respect to the strategy profile.
  arXiv  Detail & Related papers  (2023-01-20T23:55:30Z)
• Online Learning with Knapsacks: the Best of Both Worlds [54.28273783164608]
  We casting online learning problems in which a decision maker wants to maximize their expected reward without violating a finite set of $m$m resource constraints. Our framework allows the decision maker to handle its evidence flexibility and costoretic functions.
  arXiv  Detail & Related papers  (2022-02-28T12:10:48Z)
• On Improving Resource Allocations by Sharing [27.43373407900506]
  Given an initial resource allocation, our goal is to improve the allocation without reassigning resources. We introduce a formal model that allows a central authority to compute an optimal sharing between neighbors based on an initial allocation. We present algorithms for optimizing utilitarian and egalitarian social welfare of allocations and for reducing the number of envious agents.
  arXiv  Detail & Related papers  (2021-12-14T16:41:08Z)
• A Genetic Algorithm approach to Asymmetrical Blotto Games with Heterogeneous Valuations [0.0]
  Blotto Games are a popular model of multi-dimensional strategic resource allocation. We introduce a genetic algorithm inspired from biological evolution, interpreted as social learning, to solve this problem. We show that our genetic algorithm converges to the analytical Nash equilibrium of the symmetric Blotto game.
  arXiv  Detail & Related papers  (2021-03-26T10:20:19Z)
• Learning Strategies in Decentralized Matching Markets under Uncertain Preferences [91.3755431537592]
  We study the problem of decision-making in the setting of a scarcity of shared resources when the preferences of agents are unknown a priori. Our approach is based on the representation of preferences in a reproducing kernel Hilbert space. We derive optimal strategies that maximize agents' expected payoffs.
  arXiv  Detail & Related papers  (2020-10-29T03:08:22Z)
• Coordinated Online Learning for Multi-Agent Systems with Coupled Constraints and Perturbed Utility Observations [91.02019381927236]
  We introduce a novel method to steer the agents toward a stable population state, fulfilling the given resource constraints. The proposed method is a decentralized resource pricing method based on the resource loads resulting from the augmentation of the game's Lagrangian.
  arXiv  Detail & Related papers  (2020-10-21T10:11:17Z)
• Postquantum common-cause channels: the resource theory of local operations and shared entanglement [0.0]
  We define the type-independent resource theory of local operations and shared entanglement (LOSE) This allows us to formally quantify postquantumness in common-cause scenarios such as the Bell scenario. We prove several fundamental results regarding how the type of a resource determines what conversions into other resources are possible.
  arXiv  Detail & Related papers  (2020-04-13T18:03:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.