3 papers
math.OC2026
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…
cs.DM2026
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…
cs.GT2026
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…