Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

General Performance Evaluation for Competitive Resource Allocation Games via Unseen Payoff Estimation (2401.04264v1)

Published 8 Jan 2024 in cs.GT, cs.MA, math.CO, and math.OC

Abstract: Many high-stakes decision-making problems, such as those found within cybersecurity and economics, can be modeled as competitive resource allocation games. In these games, multiple players must allocate limited resources to overcome their opponent(s), while minimizing any induced individual losses. However, existing means of assessing the performance of resource allocation algorithms are highly disparate and problem-dependent. As a result, evaluating such algorithms is unreliable or impossible in many contexts and applications, especially when considering differing levels of feedback. To resolve this problem, we propose a generalized definition of payoff which uses an arbitrary user-provided function. This unifies performance evaluation under all contexts and levels of feedback. Using this definition, we develop metrics for evaluating player performance, and estimators to approximate them under uncertainty (i.e., bandit or semi-bandit feedback). These metrics and their respective estimators provide a problem-agnostic means to contextualize and evaluate algorithm performance. To validate the accuracy of our estimator, we explore the Colonel Blotto ($\mathcal{CB}$) game as an example. To this end, we propose a graph-pruning approach to efficiently identify feasible opponent decisions, which are used in computing our estimation metrics. Using various resource allocation algorithms and game parameters, a suite of $\mathcal{CB}$ games are simulated and used to compute and evaluate the quality of our estimates. These simulations empirically show our approach to be highly accurate at estimating the metrics associated with the unseen outcomes of an opponent's latent behavior.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (11)
  1. Regret in Online Combinatorial Optimization. Mathematics of Operations Research, 39(1): 31–45.
  2. The Nonstochastic Multiarmed Bandit Problem. SIAM Journal on Computing.
  3. Combinatorial Bandits. Journal of Computer and System Sciences, 78(5): 1404–1422.
  4. A Better Resource Allocation Algorithm with Semi-Bandit Feedback. In Proceedings of Algorithmic Learning Theory, 268–320. PMLR.
  5. Efficient Learning by Implicit Exploration in Bandit Problems with Side Observations. In Advances in Neural Information Processing Systems, volume 27. Curran Associates, Inc.
  6. Roberson, B. 2006. The Colonel Blotto Game. Economic Theory, 29(1): 1–24.
  7. The Heterogeneous Colonel Blotto Game. In 2014 7th International Conference on NETwork Games, COntrol and OPtimization (NetGCoop), 232–238.
  8. Vu, D. Q. 2020. Models and Solutions of Strategic Resource Allocation Problems: Approximate Equilibrium and Online Learning in Blotto Games. Ph.D. thesis, Sorbonne Universites, UPMC University of Paris 6.
  9. Combinatorial Bandits for Sequential Learning in Colonel Blotto Games. In 2019 IEEE 58th Conference on Decision and Control (CDC), 867–872.
  10. Path Planning Problems with Side Observations—When Colonels Play Hide-and-Seek. Proceedings of the AAAI Conference on Artificial Intelligence, 34(02): 2252–2259.
  11. Combinatorial Multi-armed Bandits for Resource Allocation. In 2021 55th Annual Conference on Information Sciences and Systems (CISS), 1–4.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com