2 citations · 3 across the 4 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2024★ 1 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.GT2023★ 2 cited
Mode Connectivity in Auction Design
Christoph Hertrich, Yixin Tao, László A. Végh
Optimal auction design is a fundamental problem in algorithmic game theory. This problem is notoriously difficult already in very simple settings. Recent work in differentiable eco…