y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#game-theory News & Analysis

75 articles tagged with #game-theory. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

75 articles
AINeutralarXiv – CS AI · Jun 16/10
🧠

Safe Equilibrium Policy Optimization for Strategic Agent Policies

Researchers propose Safe Equilibrium Policy Optimization (SEPO), a training method that prevents language model agents from exploiting weaker opponents, colluding on harmful outcomes, or externalizing costs during multi-agent interactions. The technique augments standard reward optimization with penalties for exploitability and collusion risk, demonstrated across strategic domains including Prisoner's Dilemma, auctions, and poker.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Social welfare optimisation under institutional reward and punishment

Researchers develop a welfare-centric framework for designing institutional incentives in multi-agent systems, revealing that schemes optimized for cost-efficiency or cooperation rates often fail to maximize total social welfare. The study provides mathematical models and algorithms for reward and punishment mechanisms in social dilemmas, showing when each approach outperforms the other.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Discovering Differences in Strategic Behavior Between Humans and LLMs

Researchers used AlphaEvolve to compare strategic behavior between humans and Large Language Models in game theory scenarios, discovering that frontier LLMs demonstrate more sophisticated strategic thinking than humans in iterated rock-paper-scissors. This finding highlights critical differences in how AI systems and humans approach strategic decision-making, with implications for deploying LLMs in competitive and social contexts.

AINeutralarXiv – CS AI · Jun 15/10
🧠

Choosing the Lens: Strategic Perspective Activation in Context-Dependent Argumentation

Researchers introduce context-dependent argumentation frameworks (CDAFs) extending Dung's argumentation theory to capture strategic manipulation of argument validity across different contexts. The framework models how an agent can selectively activate relevant criteria to influence which arguments succeed, introducing a new decision problem called ACTIVATION-MANIPULATION with unexplored complexity bounds.

AINeutralarXiv – CS AI · May 296/10
🧠

Differentiable Belief-based Opponent Shaping

Researchers introduce Differentiable Belief-based Opponent Shaping (D-BOS), a novel multi-agent reinforcement learning method that shapes opponent behavior by differentiating through their belief states rather than manipulating parameters or policies directly. The approach demonstrates superior performance in hidden-role games compared to existing methods like PPO and BBM, with particular effectiveness in mixed-motive scenarios.

AINeutralarXiv – CS AI · May 296/10
🧠

MINDGAMES: A Live Arena for Evaluating Social and Strategic Reasoning in Multi-Agent LLMs

Researchers introduced Mindgames, a multi-game arena platform for evaluating large language model agents' social and strategic reasoning across four game environments. A 2025 competition cycle tested 944 agents from 76 teams, revealing that top-performing LLMs rely heavily on explicit structural scaffolding and struggle with rule adherence, while some game environments conflate robustness to errors with genuine strategic ability.

AINeutralarXiv – CS AI · May 296/10
🧠

On the Geometry of Games and their Solvers

Researchers propose a novel framework for understanding equilibrium computation in games by mapping the geometric structure of game spaces to solver effectiveness. Rather than studying algorithms in isolation, they develop a learned representation that identifies which solver mechanisms work best across different game regimes, revealing continuous regions of algorithmic validity and suggesting that solvability is governed by underlying structural properties.

AINeutralarXiv – CS AI · May 296/10
🧠

Evolutionary Dynamics of Cooperation in Next-Generation LLM Agent Systems: A Cross-Provider Empirical Extension

Researchers extended a benchmark study on LLM agent cooperation across four frontier models (Claude Sonnet 4.6, Gemini 2.5 Flash, Gemini 3.1 Pro, GPT-5.4 Mini) using game theory simulations. While cooperative bias persists across providers, substantial divergence exists—Gemini models lean aggressive while GPT-5.4 Mini favors cooperation—suggesting provider identity, not model scale, drives equilibrium behavior.

🧠 GPT-5🧠 ChatGPT🧠 Claude
AINeutralarXiv – CS AI · May 296/10
🧠

Crafting Desirable Climate Trajectories with RL Explored Socio-Environmental Simulations

Researchers propose using reinforcement learning agents to improve Integrated Assessment Models (IAMs) that simulate climate policy outcomes, finding that cooperative agents can identify pathways to reduced emissions but competitive dynamics consistently fail to reach desirable climate futures, highlighting the need for better modeling of real-world stakeholder conflicts.

AINeutralarXiv – CS AI · May 295/10
🧠

Approximate Proportionality in Online Fair Division

Researchers resolve a gap in online fair division theory by proving that proportionality up to one good (PROP1) cannot be approximated by standard greedy algorithms against adaptive adversaries, but can be achieved through randomized allocation or learning-augmented approaches with predictions.

🏢 Meta
AINeutralarXiv – CS AI · May 296/10
🧠

The Distillation Game: Adaptive Attacks & Efficient Defenses

Researchers present a game-theoretic framework analyzing the tension between model utility and distillation vulnerability, introducing Product-of-Experts (PoE) as an efficient defense mechanism. Their adaptive evaluation methodology reveals that existing defenses are significantly weaker against adaptive attacks than passive evaluation suggests, challenging current benchmarking practices in AI security.

AINeutralarXiv – CS AI · May 286/10
🧠

Global Policy-Space Response Oracles for Two-Player Zero-Sum Games

Researchers introduce Global PSRO, an improved algorithm for computing Nash equilibria in two-player zero-sum games by using Population Exploitability metrics to guide strategy expansion more efficiently than existing methods. The approach reduces computational requirements while achieving better approximations of equilibrium solutions, advancing game-theoretic AI applications.

AINeutralarXiv – CS AI · May 286/10
🧠

TRACER: Turn-level Regret Matching with Inner Reinforcement Credit for Cooperative Multi-LLM Reasoning

Researchers introduce TRACER, a reinforcement learning framework that enables multiple large language models to collaborate effectively on reasoning tasks by learning when to speak and what to say through turn-level decision-making. The approach addresses key challenges in multi-agent AI systems including sparse rewards, computational inefficiency, and oscillating performance, demonstrating improvements across mathematical reasoning benchmarks.

AINeutralarXiv – CS AI · May 286/10
🧠

Mathematical Modelling of Ethical AI Use in Higher Education: A Coordination Game Framework for Future-Facing Learning

Researchers develop a game-theoretic framework modeling how students collectively adopt responsible or opportunistic AI use in academic assessments. The study reveals that small, well-designed changes to assessment incentives can trigger rapid behavioral shifts toward ethical AI practices, whereas policy statements alone typically fail to change behavior.

AINeutralarXiv – CS AI · May 276/10
🧠

Alignment Makes Language Models Normative, Not Descriptive

Research comparing 120 base and aligned language model pairs reveals that alignment training makes models more normative but less descriptive of actual human behavior. Base models predict real human choices in multi-round strategic games 10 times better, while aligned models excel only in single-shot, textbook scenarios where human behavior follows rational expectations.

AINeutralarXiv – CS AI · May 276/10
🧠

Rethinking Weakly-supervised Video Temporal Grounding From a Game Perspective

Researchers propose a novel game-theoretic approach to weakly-supervised video temporal grounding that models video frames and query words as cooperative game players to improve moment localization. The method addresses limitations in existing contrastive learning approaches by enabling fine-grained cross-modal interaction without relying on complex moment proposals, demonstrating superior performance on benchmark datasets.

AINeutralarXiv – CS AI · May 126/10
🧠

Playing games with knowledge: AI-Induced delusions need game theoretic interventions

Researchers propose that conversational AI systems create epistemic problems not through flawed models but through game-theoretic dynamics where sycophantic responses reinforce user biases. They introduce an "Epistemic Mediator" mechanism with belief versioning to break feedback loops that lead users toward delusional certainty, achieving 48x reduction in belief spirals.

AINeutralarXiv – CS AI · May 126/10
🧠

EquiMem: Calibrating Shared Memory in Multi-Agent Debate via Game-Theoretic Equilibrium

Researchers introduce EquiMem, a game-theoretic framework that addresses vulnerabilities in multi-agent debate systems by validating shared memory entries without relying on LLM judgments. The approach treats memory updating as a zero-trust game where agent equilibrium indicates optimal trust levels, outperforming existing safeguards while maintaining minimal computational overhead.

AINeutralarXiv – CS AI · May 126/10
🧠

Strategic commitments shape collective cybersecurity under AI inequality

Researchers present a game-theoretic model showing that unequal access to AI-powered cybersecurity tools creates persistent vulnerabilities, with weak defenders unable to afford strong protection. They propose that targeted subsidies for committed defenders adopting advanced AI defenses significantly improve overall system resilience and suppress attacks more effectively than commitment alone.

AINeutralarXiv – CS AI · May 126/10
🧠

Automated Approach for Solving Infinite-state Polynomial Reachability Games

Researchers have developed an automated algorithm for solving infinite-state polynomial reachability games, a class of two-player strategic games with applications in AI and reactive synthesis. The approach introduces ranking certificates as a formal proof mechanism and demonstrates the ability to solve previously intractable problems, including computing optimal strategies for the classical Cinderella-Stepmother game.

AINeutralarXiv – CS AI · May 126/10
🧠

The Reciprocity Gradient

Researchers introduce the reciprocity gradient, a novel machine learning method that addresses the influence attribution problem in multi-agent strategic interactions. The approach backpropagates reward signals through estimated opponent policies without requiring reward shaping, enabling agents to learn context-sensitive cooperation strategies that outperform sample-based baselines.

AINeutralarXiv – CS AI · May 126/10
🧠

Interactive Critique-Revision Training for Reliable Structured LLM Generation

Researchers propose DPA-GRPO, a novel training method for large language models that improves structured decision-making by using a generator-verifier framework where one model produces outputs and another validates them through safety assurance cases. The method demonstrates improved accuracy on tax calculation benchmarks and addresses the challenge of ensuring LLM outputs are locally correct, globally consistent, and auditable.

AINeutralarXiv – CS AI · May 126/10
🧠

Mechanism Design Is Not Enough: Prosocial Agents for Cooperative AI

Researchers prove that mechanism design alone cannot achieve optimal cooperation between AI agents due to incomplete contracts that cannot account for all future contingencies. The study demonstrates that prosocial agents—those designed to consider others' welfare alongside their own—can close this welfare gap and achieve superior outcomes in multi-agent scenarios and social dilemmas.

AINeutralarXiv – CS AI · May 126/10
🧠

Shapley Regression for Rare Disease Diagnosis Support: a case study on APDS

Researchers propose Shapley regression, a game-theoretic machine learning method for diagnosing APDS, a rare genetic immune disorder. The approach combines interpretability with predictive power by modeling symptom interactions while maintaining transparency, validated on both public datasets and a real-world cohort of 222 patients.

AINeutralarXiv – CS AI · May 126/10
🧠

Phase Transitions in Affective Meaning Divergence: The Hidden Drift Before the Break

Researchers formalize 'affective meaning divergence' (AMD)—the divergence in emotional interpretation of shared words between conversation partners—and demonstrate that it undergoes a critical phase transition before conversational breakdown. Using game-theoretic modeling and empirical analysis of 652 conversations, they show that AMD exhibits critical-slowing-down signatures predictive of relationship rupture, outperforming toxicity and sentiment baselines.

← PrevPage 2 of 3Next →