2 citations · 3 across the 4 of their papers we have counts for
5 papers
Handicap reduction for linear complementarity problems
Marianna E. -Nagy, László A. Végh
Linear Complementarity Problems (LCPs) with sufficient matrices form an important subclass of LCPs, and it remains a significant open question whether problems in this class can be…
An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
Sharat Ibrahimpur, László A. Végh
In the Flexible Graph Connectivity (FGC) problem, we are given an undirected multigraph on vertices with nonnegative edge costs, where each edge is classified as either safe or…
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…
A First Order Method for Linear Programming Parameterized by Circuit Imbalance
Richard Cole, Christoph Hertrich, Yixin Tao +1
Various first order approaches have been proposed in the literature to solve Linear Programming (LP) problems, recently leading to practically efficient solvers for large-scale LPs…
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…