3 citations · 3 across the 6 of their papers we have counts for
17 papers
Efficient Equilibrium Computation in Symmetric First-Price Auctions
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender +1
We study the complexity of computing Bayes-Nash equilibria in single-item first-price auctions. We present the first efficient algorithms for the problem, when the bidders' values…
Equilibrium Computation in First-Price Auctions with Correlated Priors
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender +1
We consider the computational complexity of computing Bayes-Nash equilibria in first-price auctions, where the bidders' values for the item are drawn from a general (possibly corre…
Discrete Single-Parameter Optimal Auction Design
Yiannis Giannakopoulos, Johannes Hahn
We study the classic single-item auction setting of Myerson, but under the assumption that the buyers' values for the item are distributed over finite supports. Using strong LP dua…
On the Computation of Equilibria in Discrete First-Price Auctions
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender +1
We study the computational complexity of computing Bayes-Nash equilibria in first-price auctions with discrete value distributions and discrete bidding space, under general subject…
A Smoothed FPTAS for Equilibria in Congestion Games
Yiannis Giannakopoulos
We present a fully polynomial-time approximation scheme (FPTAS) for computing equilibria in congestion games, under smoothed running-time analysis. More precisely, we prove that if…
On the Smoothed Complexity of Combinatorial Local Search
Yiannis Giannakopoulos, Alexander Grosz, Themistoklis Melissourgos
We propose a unifying framework for smoothed analysis of combinatorial local optimization problems, and show how a diverse selection of problems within the complexity class PLS can…