most citedApproximating Competitive Equilibrium by Nash Welfare

1 citations · 1 across the 3 of their papers we have counts for

collaborators

6 papers

cs.LG2026

Optimal Alternating Regret for Online Learning and Games

Yixin Tao, Weiqiang Zheng

We settle the minimax-optimal alternating regret, a regret notion motivated by alternating learning dynamics in games, for both online linear optimization (OLO) and online convex o…

cs.GT20261 cited

Approximating Competitive Equilibrium by Nash Welfare

Jugal Garg, Yixin Tao, László A. Végh

We study the relationship between two central concepts in the allocation of divisible goods: competitive equilibrium (CE) and allocations that maximize Nash welfare, i.e., allocati…

cs.GT2026

Pricing with a Hidden Sample

Zhihao Gavin Tang, Yixin Tao, Shixin Wang

We study prior-independent pricing for selling a single item to a single buyer when the seller observes only a single sample from the valuation distribution, while the buyer knows…

cs.GT2026

Tight Efficiency Bounds for the Probabilistic Serial and Related Mechanisms

Jugal Garg, Yixin Tao, László A. Végh

The Probabilistic Serial (PS) mechanism -- also known as the simultaneous eating algorithm -- is a canonical solution for the random assignment problem under ordinal preferences. I…

cs.GT2026

Pay for The Second-Best Service: A Game-Theoretic Approach Against Dishonest LLM Providers

Yuhan Cao, Yu Wang, Sitong Liu +3

The widespread adoption of Large Language Models (LLMs) through Application Programming Interfaces (APIs) induces a critical vulnerability: the potential for dishonest manipulation…

cs.GT2025

Fisher Meets Lindahl: A Unified Duality Framework for Market Equilibrium

Yixin Tao, Weiqiang Zheng

The Fisher market equilibrium for private goods and the Lindahl equilibrium for public goods are classic and fundamental solution concepts for market equilibria. While Fisher marke…