◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

László A. Végh

24 papers hereh-index 18838 citations58 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3
  • first author2
  • middle author3
  • last author15

Across the 23 of 24 papers where every author was matched, so the position is known.

fields
  • cs.DS12
  • math.OC5
  • cs.GT4
  • cs.DM2
  • cs.LG1
same name
  • László A. Végh — 5 papers, h 3
  • László A. Végh — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20112026
most citedDecomposable Submodular Function Minimization: Discrete and Continuous

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

collaborators
Showing cs.GTShow all

4 papers · 1 filter

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 n 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…

cs.GT2012

LP-based Covering Games with Low Price of Anarchy

Georgios Piliouras, Tomas Valla, Laszlo A. Vegh

We present a new class of vertex cover and set cover games. The price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimizati…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.