Complexity of equilibria in first-price auctions under general tie-breaking rules
We study the complexity of finding an approximate (pure) Bayesian Nash equilibrium in a
first-price auction with common priors when the tie-breaking rule is part of the input. We …
first-price auction with common priors when the tie-breaking rule is part of the input. We …
Benchmark-Tight Approximation Ratio of Simple Mechanism for a Unit-Demand Buyer
Y Jin, P Lu - 2024 IEEE 65th Annual Symposium on …, 2024 - ieeexplore.ieee.org
We study revenue maximization in the unit-demand single-buyer setting. Our main result is
that Uniform-Ironed-Virtual-Value Item Pricing guarantees a tight 3-approximation to the …
that Uniform-Ironed-Virtual-Value Item Pricing guarantees a tight 3-approximation to the …
Settling the efficiency of the first-price auction
Settling the Efficiency of the First-Price Auction Page 1 Settling the Efficiency of the First-Price
Auction YAONAN JIN Columbia University and PINYAN LU Shanghai University of Finance …
Auction YAONAN JIN Columbia University and PINYAN LU Shanghai University of Finance …
[图书][B] Bayesian Auction Design and Approximation
Y Jin - 2023 - search.proquest.com
Bayesian Auction Design and Approximation Yaonan Jin Submitted in partial fulfillment of the
requirements for the degree of Doct Page 1 Bayesian Auction Design and Approximation …
requirements for the degree of Doct Page 1 Bayesian Auction Design and Approximation …