计算机科学与博弈论

We study a setting where a set of agents engage in pairwise exchanges of freely replicable goods (e.g., digital goods such as data), where two agents grant each other a copy of a good they possess in exchange for a good they lack. Such…

The mathematical characterization of social-distancing games in classical epidemic theory remains an important question, for their applications to both infectious-disease theory and memetic theory. We consider a special case of the dynamic…

Assortment optimization is a critical tool for online retailers aiming to maximize revenue. However, optimizing purely for revenue can lead to unbalanced sales across products, potentially causing a long tail of low-selling products and…

Sequential voting rules have played a crucial role in shaping decisions within parliamentary and legislative frameworks. After observing that the existing sequential rules fail several fundamental axioms, Horan and Sprumont [2022] proposed…

Automated design of multi-agent interactions with desirable equilibrium outcomes is inherently difficult due to the computational hardness, non-uniqueness, and instability of the resulting equilibria. In this work, we propose the use of…

Recent advances in multi-agent reinforcement learning, particularly Policy-Space Response Oracles (PSRO), have enabled the computation of approximate game-theoretic equilibria in increasingly complex domains. However, these methods rely on…

Theory of Mind benchmarks for large language models typically produce aggregate scores without theoretical grounding, making it unclear whether high performance reflects strategic reasoning or surface-level heuristics. We introduce a…

Can classical game-theoretic frameworks be extended to capture the bounded rationality and causal reasoning of AI agents? We investigate this question by extending Causal Normal Form Games (CNFGs) to sequential settings, introducing…

Effectively interpreting strategic interactions among multiple agents requires us to infer each agent's objective from limited information. Existing inverse game-theoretic approaches frame this challenge in terms of a "level-1" inference…

We initiate the study of the proportionality degree for participatory budgeting, with a particular focus on two popular methods: the Method of Equal Shares (MES) and Phragmen's Sequential Rule. Among other results, we derive tight bounds…

Here we present \texttt{electoral\_sim}, an open-source Python framework for simulating and comparing electoral systems across diverse voter preference distributions. The framework represents voters and candidates as points in a…

Recent studies on many-to-one matching markets have explored agents with flexible capacity and truthful preference reporting, focusing on mechanisms that jointly design capacities and select a matching. However, in real-world applications…

The biased interaction game described the operation of systems rooted in boundedly rational interactions under conditions of scarcity. The game explored the influence of bias and demonstrated how hierarchy and inequality are emergent system…

Influential benchmarks incentivize competing model developers to strategically allocate post-training resources toward improvements on the leaderboard, a phenomenon dubbed benchmaxxing or training on the test task. In this work, we initiate…

Brand advertising plays a critical role in building long-term consumer awareness and loyalty, making it a key objective for advertisers across digital platforms. Although real-time bidding has been extensively studied, there is limited…

We propose a new deterministic symmetric recursive algorithm for solving mean-payoff games.

Informal and privatized transit services, such as minibuses and shared auto-rickshaws, are integral to daily travel in large urban metropolises, providing affordable commutes where a formal public transport system is inadequate and other…

We study multi-agent contract design, where a principal incentivizes a team of agents to take costly actions that jointly determine the project success via a combinatorial reward function. While prior work largely focuses on unconstrained…

We present an algorithm for computing all evolutionarily stable strategies in nondegenerate normal-form games with three or more players.

Despite the extensive literature on Tullock contests, computational results for the general model with heterogeneous contestants remain scarce. This paper studies the algorithmic complexity of computing a pure Nash Equilibrium (PNE) in such…