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 3
Exploratory creative pre-ranking: Hierarchical empirical-Bayes Thompson sampling for real-time creative optimization
Dynamic creative optimization decides which creative of an ad to render for each request.Three Worlds for the Price of a Logarithm: Baseline-Protected Best-of-Both-Worlds Combinatorial Semi-Bandits
Improving on a baseline requires exploring away from it, precisely where its performance may be lost.Bayesian Replicator Dynamics and the Inversion of Strict Dominance in Bimatrix Games
Replicator dynamics, the central model of evolutionary game theory, describe populations evolving under selection and agents learning by trial and error.Weighted Fairness in Multi-User Earth Observation Satellite Scheduling
As constellations of satellite grow in size, and become more costly, they are increasingly funded by multiple stakeholders who expect access to the constellation's resources that is commensurate…Online Fair Division with Frequency Predictions
We study online fair division of indivisible goods among $n$ agents with frequency predictions: before any good arrives, the algorithm learns the multiset of each agent's values for the goods, but…Jointly Modeling Preferences and Imperfect Decision-Making in Large Language Models
Do preferences Large Language Models (LLMs) express in standard elicitation tasks predict their strategic behaviour?A Factor-6 Truthful-in-Expectation Mechanism for Cascade Position Auctions
Position auctions require assigning advertisers to positions and determining their display order.Strategic Calibration in LLM Multi-Agent Systems: Audited Pivot Scoring for Truthful Elicitation
In large language model (LLM)-based multi-agent systems, reported confidence increasingly determines the allocation of scarce downstream attention, computation, and decision influence.The Conditional Value of Costly Information in Collective-Risk Dilemmas
Many high-stakes collective problems, e.g., climate mitigation and pandemic response, share a structure in which risk materializes unless a group threshold is met.Pareto-optimal Scheduling with Predictions
We study preemptive single-machine scheduling with predictions, where a prediction of the order of the jobs (or of their sizes) is available, and the objective is to minimize the total completion…TempShap: When and How Much a Feature Matters in Time-Series Forecasting
Attribution for a time-series forecaster should answer two questions that a feature-level scalar cannot: when in the input window a feature acts, and how much its influence changes across the…Fast Iterative Combinatorial Auctions via Deep Reinforcement Learning
Iterative combinatorial auctions are used in spectrum allocation, transportation, and industrial procurement, but rounds are costly.Equilibria and Learning in Competitive Market Making
We propose a market-making game played among $N \ge 2$ strategic market makers and a single non-strategic representative trader.Truthful by Omission: Click Thinning for LLM-Native Advertising
Generative AI assistants are becoming an advertising medium, embedding sponsored content in their answers.FairFRESH: A Neuro-Symbolic Framework for Fair and Explainable Household Food Recommendation
Recommender systems typically serve one user at a time.When Are We Near Nash? Certifying Solutions in General-Sum Games
Heuristic solvers for general-sum extensive-form games produce a stream of iterates, and practice reports the NashGap of the returned profile.Formalizing Cooperation and Competition: An AI-Assisted Mathematical Addendum to a 2018 Planning Thesis
We present an AI-assisted mathematical addendum to Strategic Trip Planning: Striking a Balance Between Competition and Cooperation (Amar, 2018).A Quasipolynomial Algorithm for $\ell_\infty$ Contractions
We give an algorithm for computing an $\eps$-approximate fixed point of any $d$-dimensional nonexpansion with respect to the $\ell_\infty$ norm in time $\log(1/\eps)^{O(\log^2 d)}$.Splitting Planar Necklaces with Few Straight Cuts
In the classical necklace splitting problem, beads of different colors lie on a line, and the goal is to divide them among $k$ agents using as few cuts as possible so that every agent receives the…Fixed Sets and the Hardness of Computing Correlated Equilibria
We show that computing an approximate correlated equilibrium of a polytope game is PPAD-complete, and thus polynomial-time equivalent to finding a Nash equilibrium.