archive
Every paper Pith has read. Search by title, abstract, or pith.
527 papers in cs.GT · page 5
-
Delay-averse agents stabilize equilibria in time-dependent job scheduling
Job-Scheduling Games with Time-Dependent Processing Times
-
Game model computes optimal audits against coordinated agents
Optimally Auditing Adversarial Agents
-
Linear program finds equilibrium of deceptive resource game
Asymmetric-Information Resource Allocation Games: An LP Approach to Purposeful Deception
-
No-swap-regret often loses to no-regret due to N-times slower learning
Hierarchies of No-regret Algorithms
-
Strongly polynomial algorithm computes Arctic Auction equilibria
A Strongly Polynomial Algorithm for Arctic Auctions
-
Linear contracts beat any other under distributional ambiguity
Distributional Robustness of Linear Contracts
-
Correlated equilibria verification is P-complete in reachability games
Verification of Correlated Equilibria in Concurrent Reachability Games
-
Independent signals enable near-full surplus extraction in second-price auctions
Private Private Information in Second-Price Auction
-
Log-odds pooling keeps regret below 0.026 without prior knowledge
Prior-Agnostic Robust Forecast Aggregation
-
Public order book gets Polymarket trade direction right only 59% of the time
The Anatomy of a Decentralized Prediction Market: Microstructure Evidence from the Polymarket Order Book
-
Polymarket order-book trades match on-chain truth only 59 percent of time
The Anatomy of a Decentralized Prediction Market: Microstructure Evidence from the Polymarket Order Book
-
Price systems explain voter influence in committee elections
Explanation Systems for Approval-Based Multiwinner Voting
-
LLM bidders gain higher utility under budget constraints in 6G auctions
Strategic Bidding in 6G Spectrum Auctions with Large Language Models
-
Prediction market prices coordinate political behavior when credible
Price as Focal Point: Prediction Markets,Conditional Reflexivity, and the Politics of Common Knowledge
-
This paper shows that menu mechanisms offering allocation-payment contracts achieve O(T_γ…
Learning is Revelation in Disguise: Optimal Regret and Equivalence Results for Dynamic Pricing
-
-
Core agents in TTC markets found via leading eigenvector
Fast Core Identification
-
Losing contracts force unique cooperation equilibrium in n-player dilemma
Preplay Losing Contracts: Inducing Strong Nash Equilibrium in the $n$-player Prisoner's Dilemma
-
Authenticated state projections cannot guarantee valid execution
Reconstructive Authority Model: Runtime Execution Validity Under Partial Observability
-
SDP solutions match zero-sum game strategies under constraint qualification
On the equivalence of semidefinite programming and zero-sum semidefinite games
-
This paper develops a framework for linear quadratic dynamic games where players design…
Strategically Robust Linear Quadratic Dynamic Games
-
Double auction with voting selects reliable workers for location tasks
TRUST-SC: Truthful Multi-Task Double Auction for Quality-Aware Spatial Crowdsourcing in Strategic Environment
-
Optimizing AI feature highlights is hard when humans are sophisticated
Algorithmic Feature Highlighting for Human-AI Decision-Making
-
Low types hack benchmarks in ML contests
On Benchmark Hacking in ML Contests: Modeling, Insights and Design
-
Scoring on verified outcomes makes banks report risks truthfully
Mechanism Design for Decentralized Risk Detection: Strict Propriety, Network Coalitions, and the Backfiring Mandat
-
Scoring mechanism makes firms report risk data truthfully
Mechanism Design for Decentralized Risk Detection: Strict Propriety, Network Coalitions, and the Backfiring Mandat
-
Proper scoring rule makes truthful risk reporting a Nash equilibrium
Mechanism Design for Decentralized Risk Detection: Strict Propriety, Network Coalitions, and the Backfiring Mandat
-
MinCov finds near-optimal critical contributors thousands of times faster
The CriticalSet problem: Identifying Critical Contributors in Bipartite Dependency Networks
-
Ride-hailing equilibrium computed as fixed point of driver decisions
A Markovian Traffic Equilibrium Model for Ride-Hailing
-
Algorithm lists every Pareto-optimal one-sided matching
Finding Pareto frontier for one-sided matching
-
Algorithm lists all Pareto-optimal matchings in one-sided problems
Finding Pareto frontier for one-sided matching
-
Autonomy qualifies the First Welfare Theorem for AGI economies
Post-AGI Economies: Autonomy and the First Fundamental Theorem of Welfare Economics
-
This paper proposes the Identity-Bound Asset Integrity Model (IBAIM) to stop economic…
Decoupling Speculation from Merit: The Identity-Bound Asset Integrity Model (IBAIM) for Sustainable Web3 Gaming
-
AI agents aggregate info well only in simple prediction markets
Information Aggregation with AI Agents
-
Voting rules trade voter contraction for candidate dispersion
Geometric Comparisons of Electoral Rules Under Feedback
-
No-regret learner plus EVI solver yields online multicalibration
An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to $\Phi$-Regret Minimization
-
No election found needing Condorcet set larger than three
Is Four Enough? Automated Reasoning Approaches and Dual Bounds for Condorcet Dimensions of Elections
-
35 watchers prevent double-spends without global consensus
Intercloud: Eventual Consistency for Decentralised Economies via Chilling-Effect Consensus
-
Maximin matches Nash by count in positive-sum games
How damaging is zero-sum thinking to an agent's interests when the world is positive-sum?
-
SGD achieves O(log t / t^{1/3}) last-iterate rate in co-coercive games
Last-Iterate Guarantees for Learning in Co-coercive Games
-
Mapping breaks ILA modules into facts and procedures for targeted AWW lessons
Analysis of AWW (Anganwadi Workers) Training Content, ILA (Incremental Learning Approach) Modules Following CDT (Component Display Theory)
-
Target correction unifies mirror descent for monotone inequalities
Target Mirror Descent: A Unifying Framework for Solving Monotone Variational Inequalities
-
Always pair new products with top incumbents to learn quality
Optimal Exploration of New Products under Assortment Decisions
-
SAT solver finds EFX counterexample for three agents and eight goods
A Counterexample to EFX $n \ge 3$ Agents, $m \ge n + 5$ Items, Submodular Valuations via SAT-Solving
-
EFX allocations fail for three agents and eight goods
A Counterexample to EFX $n \ge 3$ Agents, $m \ge n + 5$ Items, Submodular Valuations via SAT-Solving
-
Few strategic voters can overhaul MLE rankings past small budget
Ranking Abuse via Strategic Pairwise Data Perturbations
-
Algorithms find or rule out unanimous lotteries with queries
Learning Unanimously Acceptable Lotteries via Queries
-
Generalized Unbounded Minimax beats main multiplayer search algorithms
Study and Improvement of Search Algorithms in Multi-Player Perfect-Information Games
-
Necklace method assigns coalition calculations evenly across agents
From Necklaces to Coalitions: Fair and Self-Interested Distribution of Coalition Value Calculations
-
Fair lotteries can be split without creating likely envy
Decomposition Envy-Freeness in Random Assignment