László A. Végh

2 accepted papers

2023

Mode Connectivity in Auction Design

Christoph Hertrich, Yixin Tao, László A. Végh

NeurIPS 2023poster

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 economics showed that neural networks can efficiently learn known optimal auction mechanisms and discover interesting new o…

Cited by 4 Source ↗PDF ↗Scholar ↗

2017

Decomposable Submodular Function Minimization: Discrete and Continuous

Alina Ene, Huy Nguyen, László A. Végh

NeurIPS 2017spotlight

This paper investigates connections between discrete and continuous approaches for decomposable submodular function minimization. We provide improved running time estimates for the state-of-the-art continuous algorithms for the problem using combinatorial arguments. We also provide a systematic expe…

Cited by 32 Source ↗PDF ↗Scholar ↗