Cover Image

On the Computation of Equilibria in Discrete First-Price Auctions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Filos-Ratsikas, Aris, Giannakopoulos, Yiannis, Hollender, Alexandros, Kokkalis, Charalampos
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Equilibrium Computation in First-Price Auctions with Correlated Priors
by: Filos-Ratsikas, Aris, et al.
Published: (2025)

Efficient Equilibrium Computation in Symmetric First-Price Auctions
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

A Smoothed FPTAS for Equilibria in Congestion Games
by: Giannakopoulos, Yiannis
Published: (2023)

Tight Inapproximability of Nash Equilibria in Public Goods Games
by: Dinh, Jérémi Do, et al.
Published: (2024)

A Theoretical Approach to Stablecoin Design via Price Windows
by: Molinet, Katherine, et al.
Published: (2026)

Constant Inapproximability of Pacing Equilibria in Second-Price Auctions
by: Chen, Xi, et al.
Published: (2025)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
by: Ghosh, Abheek, et al.
Published: (2024)

Envy-Free Cake-Cutting for Four Agents
by: Hollender, Alexandros, et al.
Published: (2023)

The Distortion of Stable Matching
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

Truthful Interval Covering
by: Deligkas, Argyrios, et al.
Published: (2023)

Approximate-EFX Allocations with Ordinal and Limited Cardinal Information
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

Utilitarian Distortion with Predictions
by: Filos-Ratsikas, Aris, et al.
Published: (2025)

On the Smoothed Complexity of Combinatorial Local Search
by: Giannakopoulos, Yiannis, et al.
Published: (2022)

Constant Inapproximability for Fisher Markets
by: Deligkas, Argyrios, et al.
Published: (2026)

Constant Inapproximability for PPA
by: Deligkas, Argyrios, et al.
Published: (2022)

Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD
by: Deligkas, Argyrios, et al.
Published: (2026)

Pure-Circuit: Tight Inapproximability for PPAD
by: Deligkas, Argyrios, et al.
Published: (2022)

Discrete Single-Parameter Optimal Auction Design
by: Giannakopoulos, Yiannis, et al.
Published: (2024)

Approximate Envy-Free Allocations up to any $k$ Goods
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

Proportionality Degree in Participatory Budgeting
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

Computing Equilibrium Points of Electrostatic Potentials
by: Ghosh, Abheek, et al.
Published: (2025)

Optimal Metric Distortion for Matching on the Line
by: Filos-Ratsikas, Aris, et al.
Published: (2025)

Efficiently Computing Equilibria in Budget-Aggregation Games
by: Becker, Patrick, et al.
Published: (2025)

Pushing the Frontier on Approximate EFX Allocations
by: Amanatidis, Georgios, et al.
Published: (2024)

On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes
by: Amanatidis, Georgios, et al.
Published: (2023)

On the Complexity of Learning Nash Equilibria
by: Biggar, Oliver, et al.
Published: (2026)

Hardness of Approximate Hylland-Zeckhauser Equilibria
by: Braverman, Mark, et al.
Published: (2026)

Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier
by: Ron, Shiri, et al.
Published: (2024)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
by: Hansen, Kristoffer Arnsfelt, et al.
Published: (2025)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
by: Anagnostides, Ioannis, et al.
Published: (2025)

Robust Stackelberg Equilibria
by: Gan, Jiarui, et al.
Published: (2023)

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
by: Anagnostides, Ioannis, et al.
Published: (2023)

Min-Max Optimization Requires Exponentially Many Queries
by: Bernasconi, Martino, et al.
Published: (2026)

On the Uniqueness of Bayesian Coarse Correlated Equilibria in Standard First-Price and All-Pay Auctions
by: Ahunbay, Mete Şeref, et al.
Published: (2024)

Pacing Equilibria in Second-Price Auctions with Few Goods
by: Huang, Yiyang, et al.
Published: (2026)

Complexity of Auctions with Interdependence
by: Loiseau, Patrick, et al.
Published: (2026)

The Computational Complexity of the Housing Market
by: Lock, Edwin, et al.
Published: (2024)

Pre- and Post-Auction Discounts in First-Price Auctions
by: Alcobendas, Miguel, et al.
Published: (2024)

Computing Perfect Bayesian Equilibria in Sequential Auctions with Verification
by: Thoma, Vinzenz, et al.
Published: (2023)

Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games
by: Li, Tongyang, et al.
Published: (2025)