Theory & Algorithms · Computer Science & AI
Computer Science & Game Theory
The newest papers in Computer Science & Game Theory that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
252 papers, from 4 September 2026 to 5 November 2026: 252 arXiv preprints.
Get the few papers worth your time in Computer Science & Game Theory every morning.
Follow Computer Science & Game Theory and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 7
Spatial Pattern Formation from Multi-Agent Learning in Public Goods Dilemmas
Spatial public goods models show that prescribed movement toward richer locations can generate spatial patterns.Beyond Nominal Equilibria: Risk-Averse Multi-Population Mean-Field Games
Recent advances in mean-field games and its multi-population variants enable large-scale heterogeneous multi-agent systems to be modeled through representative agents and their associated mean-field…The Confidence Game: Strategic Miscalibration in Human-AI Delegation
Calibrated uncertainty quantification is essential to ensuring AI agents are trustworthy and reliable.Envy-free Allocations with Individual Payments
When an envy-free allocation of indivisible goods does not exist, monetary transfers can restore envy-freeness.Optimal Regret for Online Market Making with Limit Order Book
We study online learning in market making, where, at each round, a market maker posts bid and ask prices before observing the market price and the private valuation of an incoming trader.Minimizing Cumulative Envy in Allocating a Sequence of Items
We study temporal fair division with indivisible goods that arrive sequentially and must be allocated irrevocably.Marrying Pricing and Advertising with LLMs
We study a sequential pricing problem in which a seller jointly posts a price and an advertisement generated by a large language model (LLM).Explicit Asymptotic Bounds for Sequential Calibration Beyond $T^{2/3}$
Probability forecasts are calibrated when predicted probabilities match empirical outcome frequencies: among events assigned a probability $p$, we'd hope that the fraction of positive outcomes is…Stochastic Gradient Descent Ascent is Suboptimal for Nonconvex-PL Min-Max Games
How far can stochastic gradient descent ascent (SGDA) go by tuning its timescale ratio and step sizes in nonconvex min-max games?Network Intervention by Polling Strategic Agents
A planner in a network of strategic agents faces three entangled challenges: the optimum depends on agents' private information, queried agents may misreport to steer the outcome, and exact…Efficient Algorithms for Online Subadditive Combinatorial Allocations
For the online combinatorial allocation problem with subadditive valuations, Correa and Cristi (STOC 2023) proved the existence of a $6$-competitive online algorithm, improving on the previous best…Priority Coordination Games: Hodge Decomposition and a Sharp Design Limit
In decentralised priority coordination, agents announce priority levels and a shared resource serves them in decreasing order, as at an unsignalised intersection; the levels form the decision layer…Incentive Alignment in Online Experimentation
Evaluating the causal effect of new features is a central goal for online platforms.Fast Last-Iterate Convergence in Zero-Sum Markov Games with Bandit Feedback
We study last-iterate convergence in unknown two-player zero-sum discounted Markov games with bandit feedback.Parallelism or Concession? Concurrency-Aware Procurement Negotiation for Agentic Commerce
Agentic buyers can cheaply fork a procurement task into many parallel negotiations, but concurrency is not free: every thread consumes resources, and simultaneous agreements create cancellation and…Near-Exact Computation of Independent Chip Model Placement Probabilities for Thousands of Players
The Independent Chip Model (ICM) converts the chip stacks of the players remaining in a poker tournament into finishing-place probabilities and prize equities.Rethinking Least-Core Computation in Contextual-Distractor Games
Game-theoretic attribution explains a model by assigning credit to its features or training examples.Feedback Dominance Analysis for Pursuit-Evasion Games on Graphs
This work identifies the dominance regions for discrete, simultaneous-move pursuit-evasion games on graphs.A Decremental Algorithm for Checking the Possibility of Braess Paradox in Dynamic Nets
Braess paradox originates when latency at Wardrop equilibrium in traffic networks decreases because of removing edges.MIRT: Transformers for Truthful Generative Auctions with Whole-feed Permutation Externalities
Modern online platforms commonly rank ads and organic content separately before blending them into a feed displayed to the user, overlooking externalities: an item's click-through rate depends on…