archive
Every paper Pith has read. Search by title, abstract, or pith.
527 papers in cs.GT · page 1
-
Variational inequality gives mixed traffic equilibrium without convexity
Routing Equilibrium in Mixed-Autonomy Traffic Networks with Altruistic Autonomous Agents
-
IRV limit manipulation rate stays below 1 for any candidate count
Super Condorcet Winners and Limit Coalitional Manipulability of IRV
-
Exact formula for cooperation rate in asymmetric public goods games
Introspection Dynamics with Mutation in Additive Games
-
Threshold algorithms exceed half welfare in class-fair matching
Beyond the Half-Approximation: Fair and Efficient Online Class Matching
-
Prudent-Banker keeps bandit safety at constant cost amid delays
Prudent-Banker: No Extra Fees for Baseline Safety in Adversarial Bandits With and Without Delays
-
Generated card games expose jagged strategic skills in top LLMs
GENSTRAT: Toward a Science of Strategic Reasoning in Large Language Models
-
XDO adaptation solves indefinite deception games on graphs
Deception and Counter Deception in Adversarial Graph Traversal Game
-
Lipschitz intermediaries enable approximate calibration of discrete properties
Smoothed Elicitation Complexity for Approximate $\Gamma$-calibration of Discrete Classification Tasks
-
Builder defection exposes MEV surplus in arbitrage and liquidations
Imperfect Commitment in Maximal Extractable Value Auctions
-
Game model guides trauma teams to best outcome under limits
A Generalized Nash Equilibrium-Seeking Scheme for Trauma Resuscitation
-
Core always non-empty for standard multi-winner rules
Multi-Winner Voting Games in TU and NTU: When is the Core Always Non-Empty?
-
Algorithms achieve optimal bidding rates despite feedback shilling
Do Not Trust The Auctioneer: Learning to Bid in Feedback-Manipulated Auctions
-
Nash bargaining in RL lifts EV energy trading welfare 61 percent
Incentive-Aligned Vehicle-to-Vehicle Energy Trading via Nash-Integrated Multi-Agent Reinforcement Learning
-
Potential game lets edge users cut AI content delays
Joint Communication and Computation Scheduling for MEC-enabled AIGC Services: A Game-Theoretic Stochastic Learning Approach
-
Humans beat LLMs in Colonel Blotto tournaments
Not Yet: Humans Outperform LLMs in a Colonel Blotto Tournament
-
Intermediary drives seller revenue arbitrarily low for regular distributions
Single-Item Auctions with a Monopolist Intermediary
-
Chore division resists EFX approximation below factor 1.26
A Note on EFX Inapproximability for Chores
-
PTAS finds near-optimal team order for majority wins
The Team Order Problem: Maximizing the Probability of Matching Being Large Enough
-
Local updates cut Shapley recompute cost by 1000 times
Dynamic Shapley Computation
-
SVD reduces multi-dimensional matching to fast one-dimensional optimization
Multi-Dimensional Matching in Market Design
-
Clipped Linear Lottery stabilizes randomized picks with near-optimal regret
Smooth Partial Lotteries for Stable Randomized Selection
-
This paper proposes the Clipped Linear Lottery
Smooth Partial Lotteries for Stable Randomized Selection
-
Nash equilibrium scores filter unstable multimodal reasoning steps
A Nash Equilibrium Framework For Training-Free Multimodal Step Verification
-
Complexity mapped for equilibria in multiplayer graph games
Equilibria in Multiplayer Graph Games: An Algorithmic Study
-
Parallel CFR runs 3.3 times faster on billion-history poker trees
Real-Time Parallel Counterfactual Regret Minimization
-
Deficit rule bounds fairness slack to square root of time
Perpetual Fully-Online Approximate Fairness
-
One-dimensional maps produce atypical bifurcation diagrams
Strange bifurcation diagrams
-
Flip noise privacy yields subsidy of μηΔ in Glosten-Milgrom trades
The Privacy Subsidy in Glosten-Milgrom: Bid-Ask Spread and Welfare under Flip-Noise Direction Observation
-
Triplet data needed to measure voter disagreements accurately
Efficient Elicitation of Collective Disagreements
-
Rational competitors match faulty GPS accuracy as group size grows
Competitive Search with a Faulty Satnav (GPS): When Probability Matching is Rational
-
LLMs close 99% of deals but earn low profits in hidden pricing
PrefBench: Evaluating Zero-Shot LLM Agents in Hidden-Preference Personalized Pricing Negotiations
-
Risk measures create equilibria for games with sampled payoff data
Distributionally Robust Games via Coherent Risk Measures
-
Centralized critic removes action-sampling variance in self-play RL
GAE Falls Short in Imperfect-Information Self-Play Reinforcement Learning
-
Correlated optimins improve on equilibria in every finite game
Correlated optimin
-
High Nash welfare guarantees stability in coalition games
Nash Welfare in Additively Separable Hedonic Games
-
Token Splitting Turns Concave DAO Votes Linear
Concave is the New Linear: The Impossibility of Anti-Plutocratic DAO Governance
-
Strategyproof rules characterized for reconnecting regions after disruptions
Mechanism Design for Connecting Regions Under Disruptions
-
Sensitivity to bias raises opponent entropy in human RPS
Toward an Origin of Human Randomness: Interaction-Driven Enhancement in the Rock-Paper-Scissors Game
-
Directed network games yield closed-form Shapley values
A Tractable Class of Cooperative Games Defined by Directed Networks: Unanimity Decomposition and Shapley Value
-
Weak coupling yields equilibrium in decentralized agent learning
Learning Empirical Evidence Equilibria under Weak Environmental Coupling
-
Weak coupling lets decentralized agents reach equilibria
Learning Empirical Evidence Equilibria under Weak Environmental Coupling
-
Graphs turn puzzle solving into measurable distances
God numbers for Graphs, Games and Groups
-
Correlated equilibrium in quadratic games matches contraction hardness
On the Complexity of Correlated Equilibria Beyond Normal-Form Games
-
RRM algorithms converge to efficient Bayes-Nash equilibrium
Convergence of Stochastic First-Order Algorithms in Bertrand Competition Under Incomplete Information
-
Controller placement games on graphs are NP-complete or ΣP2-complete
Modelling Network Resilience: The Complexity of Some Graph Division Games
-
Mechanism satisfies all three goals in diffusion auctions
Probabilistic Mechanism Design in Diffusion Auctions
-
Probabilistic surjectivity forces near-dictatorship in classification
Classification aggregation: a quantitative impossibility theorem
-
High-probability coverage still forces near-dictatorship in classification aggregation
Classification aggregation: a quantitative impossibility theorem
-
Strategy beats trump count in Briscola tests
Beyond the briscola advantage: a Monte Carlo dominance test for deterministic strategies in two-player Briscola Game
-
Mechanism designs truthful social laws that maximize profit
A Truthful Multiunit Profit-Optimal Mechanism for Synthesizing Social Laws