21 articles tagged with #game-theory. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers have introduced FAIRGAME, a new framework that uses game theory to identify biases in AI agent interactions. The tool enables systematic discovery of biased outcomes in multi-agent scenarios based on different Large Language Models, languages used, and agent characteristics.
A game-theoretic study analyzes how regulatory policies affect AI supply chains where foundation model providers serve downstream firms. The research finds that price competition policies work best with high compute costs, while quality competition policies always improve consumer surplus, offering guidance for effective AI market regulation.
Researchers propose a game-theoretic framework using Stackelberg equilibrium and Rapidly exploring Random Trees to model interactions between attackers trying to jailbreak LLMs and defensive AI systems. The framework provides a mathematical foundation for understanding and improving AI safety guardrails against prompt-based attacks.
Researchers introduce GLEE, a new framework for studying how Large Language Models behave in economic games and strategic interactions. The study reveals that LLM performance in economic scenarios depends heavily on market parameters and model selection, with complex interdependent effects on outcomes.
Researchers have developed Obscuro, the first AI system to achieve superhuman performance in Fog of War chess, a complex imperfect-information variant of chess. The breakthrough introduces new search techniques for imperfect-information games and represents the largest zero-sum game where superhuman AI performance has been demonstrated under imperfect information conditions.
Researchers introduce a framework for studying how emotional states affect decision-making in small language models (SLMs) used as autonomous agents. Using activation steering techniques grounded in real-world emotion-eliciting texts, they benchmark SLMs across game-theoretic scenarios and find that emotional perturbations systematically influence strategic choices, though behaviors often remain unstable and misaligned with human patterns.
Researchers propose IAMFM, a framework that combines game-theoretic incentives with optimization algorithms to improve how ads are placed in LLM-generated content while controlling computational costs. The approach guarantees strategic advertisers behave honestly and introduces a novel "warm-start" method for efficient payment calculations in complex ad auctions.
Researchers developed the Strategic Courtroom Framework, a multi-agent simulation where LLM-based prosecution and defense teams engage in iterative legal argumentation with trait-conditioned personalities. Testing across 7,000+ simulated trials revealed that diverse teams with complementary traits outperform homogeneous ones, and a reinforcement learning system can dynamically optimize team composition, demonstrating language as a strategic action space in adversarial domains.
Researchers propose the Content Creation with Spillovers (CCS) model to address how GenAI and LLMs create positive spillovers where creators' content can be reused by others, potentially undermining individual incentives. They introduce Provisional Allocation mechanisms to guarantee equilibrium existence and develop approximation algorithms to maximize social welfare in content creation ecosystems.
Researchers have developed ESENSC_rev2, a polynomial-time alternative to SHAP for AI feature attribution that offers similar accuracy with significantly improved computational efficiency. The method uses cooperative game theory and provides theoretical foundations through axiomatic characterization, making it suitable for high-dimensional explainability tasks.
Researchers developed a new multi-agent reinforcement learning algorithm that uses strategic risk aversion to create AI agents that can reliably collaborate with unseen partners. The approach addresses the problem of brittle AI collaboration systems that fail when working with new partners by incorporating robustness against behavioral deviations.
OpenAI has released LOLA (Learning with Opponent-Learning Awareness), an algorithm that enables AI agents to model and adapt to other learning agents. The system can develop collaborative strategies like tit-for-tat in game theory scenarios while maintaining self-interest.
The article discusses anti-pre-revelation games in Ethereum applications that rely on incentivized multi-party data provision. These mechanisms are designed to address risks in voting, random number generation, and other decentralized data collection scenarios where early information disclosure could compromise system integrity.
The article explores incentive-compatibility in cryptoeconomic algorithms, examining how bounded rationality affects the design of blockchain consensus mechanisms, reputation systems, and trading processes. It discusses the challenges of creating systems where participants' optimal strategies align with desired network outcomes.
Researchers propose CORA, a new cooperative game-theoretic method for credit assignment in multi-agent reinforcement learning that uses coalition-wise advantage allocation. The approach addresses policy optimization challenges by evaluating marginal contributions of different agent coalitions and demonstrates superior performance across various benchmarks.
Researchers present new theoretical frameworks for fair allocation of indivisible goods when limited sharing is allowed among agents. The study introduces cost-sensitive sharing mechanisms and proves that maximin share (MMS) allocations can be guaranteed under specific conditions, while also establishing new fairness concepts like Sharing Maximin Share (SMMS).
Researchers introduce Valet, a standardized testbed featuring 21 traditional imperfect-information card games designed to benchmark AI algorithms. The platform uses RECYCLE, a card game description language, to standardize implementations and facilitate comparative research on game-playing AI systems.
This article discusses the historical development of Casper consensus mechanism in Fall 2014, focusing on game theory and economic security modeling research. The research on 'bribing attacker models' led to breakthrough solutions for addressing long-range attack problems in proof-of-stake systems.
Researchers developed COffeE-PSRO, a new algorithm that applies offline reinforcement learning to game-theoretic multiagent systems. The approach extends Policy Space Response Oracles by incorporating uncertainty quantification and conservative exploration to find equilibrium strategies from fixed datasets without online interaction.
Researchers have developed an AI framework combining Hidden Markov Models and Deep Q-Networks to optimize energy strategy decisions in Formula 1 racing under new 2026 regulations. The system infers competitor states from observable telemetry data and detects deceptive racing strategies with over 95% accuracy.
Researchers introduce resilient strategies for stochastic systems, focusing on decision-making that remains robust against disturbances that could flip agent decisions. The work presents fundamental problems for Markov decision processes with reachability and safety objectives, extending to stochastic games with various disturbance aggregation methods.
