Game Theory Papers
@DO
Followers
2K
Following
0
Media
0
Statuses
14K
New Game Theory submissions to https://t.co/HHqPequzVU (not affiliated with https://t.co/HHqPequzVU)
Worldwide
Joined December 2010
Understanding LLM Agent Behaviours via Game Theory: Strategy Recognition, Biases and Multi-Agent Dynamics.
arxiv.org
As Large Language Models (LLMs) increasingly operate as autonomous decision-makers in interactive and multi-agent systems and human societies, understanding their strategic behaviour has profound...
0
1
2
Small-Gain Nash: Certified Contraction to Nash Equilibria in Differentiable Games.
arxiv.org
Classical convergence guarantees for gradient-based learning in games require the pseudo-gradient to be (strongly) monotone in Euclidean geometry as shown by rosen(1965), a condition that often...
0
0
0
Starlink Mini offers fast, reliable internet on the go—great for traveling, camping, exploring, boating, RVing, and more. Stay connected without dead zones or slow speeds. Order online in under 2 minutes.
392
1K
7K
Data as Voters: Core Set Selection Using Approval-Based Multi-Winner Voting.
arxiv.org
We present a novel approach to the core set/instance selection problem in machine learning. Our approach is based on recent results on (proportional) representation in approval-based multi-winner...
0
0
0
Attacking and Securing Community Detection: A Game-Theoretic Framework.
arxiv.org
It has been demonstrated that adversarial graphs, i.e., graphs with imperceptible perturbations, can cause deep graph models to fail on classification tasks. In this work, we extend the concept of...
0
0
0
Analyzing the Economic Impact of Decentralization on Users.
arxiv.org
We model the ultimate price paid by users of a decentralized ledger as resulting from a two-stage game where Miners (/Proposers/etc.) first purchase blockspace via a Tullock contest, and then...
0
0
0
Learning-Augmented Facility Location Mechanisms for the Envy Ratio Objective.
arxiv.org
The augmentation of algorithms with predictions of the optimal solution, such as from a machine-learning algorithm, has garnered significant attention in recent years, particularly in facility...
0
0
0
Computational Modelling for Combinatorial Game Strategies.
arxiv.org
We develop a generic computational model that can be used effectively for establishing the existence of winning strategies for concrete finite combinatorial games. Our modelling is (equational)...
0
1
3
Distributionally Robust Markov Games with Average Reward.
arxiv.org
We study distributionally robust Markov games (DR-MGs) with the average-reward criterion, a framework for multi-agent decision-making under uncertainty over extended horizons. In average reward...
0
0
2
Designing Truthful Mechanisms for Asymptotic Fair Division.
arxiv.org
We study the problem of fairly allocating a set of $m$ goods among $n$ agents in the asymptotic setting, where each item's value for each agent is drawn from an underlying joint distribution....
0
0
0
Dynamics of multidimensional Simple Clock Auctions.
arxiv.org
Simple Clock Auctions (SCA) are a mechanism commonly used in spectrum auctions to sell lots of frequency bandwidths. We study such an auction with one player having access to perfect information...
0
0
1
LLM-Auction: Generative Auction towards LLM-Native Advertising.
arxiv.org
The rapid advancement of large language models (LLMs) necessitates novel monetization strategies, among which LLM-native advertising has emerged as a promising paradigm by naturally integrating...
0
0
0
Certifying Concavity and Monotonicity in Games via Sum-of-Squares Hierarchies.
arxiv.org
Concavity and its refinements underpin tractability in multiplayer games, where players independently choose actions to maximize their own payoffs which depend on other players' actions. In...
0
1
0
Computing Evolutionarily Stable Strategies in Imperfect-Information Games.
arxiv.org
We present an algorithm for computing evolutionarily stable strategies (ESSs) in symmetric perfect-recall extensive-form games of imperfect information. Our main algorithm is for two-player games,...
0
0
1
Does Timeboost Reduce MEV-Related Spam? Theory and Evidence from Layer-2 Transactions.
arxiv.org
Maximal extractable value opportunities often induce spam in Layer-2 blockchains: many identical transactions are submitted near simultaneously, most of which revert, wasting blockspace. We study...
0
0
0
No-Regret Learning in Stackelberg Games with an Application to Electric Ride-Hailing.
arxiv.org
We consider the problem of efficiently learning to play single-leader multi-follower Stackelberg games when the leader lacks knowledge of the lower-level game. Such games arise in hierarchical...
0
2
2
Online Price Competition under Generalized Linear Demands.
arxiv.org
We study sequential price competition among $N$ sellers, each influenced by the pricing decisions of their rivals. Specifically, the demand function for each seller $i$ follows the single index...
0
1
0
Dynamic one-time delivery of critical data by small and sparse UAV swarms: a model problem for MARL scaling studies.
arxiv.org
This work presents a conceptual study on the application of Multi-Agent Reinforcement Learning (MARL) for decentralized control of unmanned aerial vehicles to relay a critical data package to a...
0
0
0