activity
20112026
most citedDecomposable Submodular Function Minimization: Discrete and Continuous

15 citations · 42 across the 16 of their papers we have counts for

collaborators

24 papers

math.OC2026

On finding exact solutions of linear programs in the oracle model

Daniel Dadush, László A. Végh, Giacomo Zambelli

We consider linear programming in the oracle model: , where the polyhedron is given by a separation oracle. We…

cs.GT2023★ 1 cited

Faster Dynamic Auctions via Polymatroid Sum

Katharina Eickhoff, Meike Neuwohner, Britta Peis +3

We consider dynamic auctions for finding Walrasian equilibria in markets with indivisible items and strong gross substitutes valuation functions. Each price adjustment step in thes…

cs.GT2020

Approximating Nash Social Welfare under Rado Valuations

Jugal Garg, Edin Husic, Laszlo A. Vegh

We consider the problem of approximating maximum Nash social welfare (NSW) while allocating a set of indivisible items to agents. The NSW is a popular objective that provides a…

cs.GT2019★ 3 cited

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands

Jugal Garg, Edin Husić, László A. Végh

We consider the Arrow--Debreu exchange market model under the assumption that the agents' demands satisfy the weak gross substitutes (WGS) property. We present a simple auction alg…

math.OC2019★ 1 cited

Signed tropical convexity

Georg Loho, László A. Végh

We establish a new notion of tropical convexity for signed tropical numbers. We provide several equivalent descriptions involving balance relations and intersections of open halfsp…

cs.DS2018

A Strongly Polynomial Algorithm for Linear Exchange Markets

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

We present a strongly polynomial algorithm for computing an equilibrium in Arrow-Debreu exchange markets with linear utilities. Our algorithm is based on a variant of the weakly-po…