Paper models how AI changes academic effort and hiring signals
The model classifies pure-strategy equilibria and uses learning simulations of applicants and recruiters.
Stories per day · 30 days
Relatedacademic-hiring1ai-generated-papers1cs-cr1nash-equilibrium1optimization1path-following1phone-scams1research-incentives1scam-baiting1variational-inequalities1
12 stories, newest first · one card per story
Stories tagged #game-theory
Fixed-point bundle method computes Nash equilibria on product simplices
The path-following algorithm reached 10^{-5} precision on all 5600 random games, from 2-player 128-action to 128-player 2-action.
Paper uses game theory and LLMs to bait phone scammers
Across 300 simulated dialogues, adaptive play was 28.9–79.7% closer to Nash equilibrium than static baselines.
Choosing LLMs for Strategic Agent Interactions
Selecting LLMs for strategic games is game- and opponent-specific; a stationary bandit beats more complex selectors but not the best fixed model.
The False Allure of "Security by Obscurity": A Game-Theoretic Approach
A game-theoretic model shows obscured systems suffer more successful attacks in equilibrium than open systems.
Defensive Sufficiency in a Stackelberg Model of AI Security
A Stackelberg model finds when red-team feedback and repairs suffice to defend finite AI attack surfaces.
Multiplicative Optimism for Constant Regret in Games
Multiplicatively Optimistic Regret Matching gives near-constant external regret in general-sum games under self-play.
Guiding Agents of Quantum Games to Equilibrium using Matrix Exponential Fixed-Point Iteration
MEFPIA searches quantum-game equilibria faster, with lower error than matrix multiplicative-weights updates on tested instances.
Epsilon-Nash Equilibria in History-Dependent SA-MDPs
Researchers give the first algorithm for computing epsilon-approximate history-dependent equilibria in state-adversarial Markov decision processes with observation-perturbing adversaries.
Decentralized network congestion control for DAG-based distributed ledger system
Researchers propose node-specific variable proof-of-work to curb transaction spamming in DAG-based distributed ledgers, proving a Nash equilibrium enforces prescribed node behavior.
Bilevel Coordinated Reflection: A Game-Theoretic Approach to Multi-Agent LLM Systems
Paper models multi-agent LLM orchestration as a bilevel game, proving transcript-only gating limits and introducing grounded-memory SRMA.
Import AI 468: 23 RSI ideas; PostTrainBench+; and how trust and transparency interplay with AI racing
Import AI covers 23 IFP policy ideas for automated AI R&D risks and MIT/Columbia's game theory of AI racing slowdowns.