[PDF][PDF] Mechanism design and approximation

JD Hartline - Book draft. October, 2013 - jasonhartline.com
This text provides a look at select topics in economic mechanism design through the lens of
approximation. It reviews the classical economic theory of mechanism design wherein a …

Optimal auctions vs. anonymous pricing

S Alaei, J Hartline, R Niazadeh, E Pountourakis… - Games and Economic …, 2019 - Elsevier
For selling a single item to agents with independent but non-identically distributed values,
the revenue optimal auction is complex. With respect to it, Hartline and Roughgarden (2009) …

First Price Auction is 1-1/e2 Efficient

Y Jin, P Lu - Journal of the ACM, 2023 - dl.acm.org
First Price Auction is 1-1/e2 Efficient | Journal of the ACM skip to main content ACM Digital
Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign in …

Robust algorithms for the secretary problem

D Bradac, A Gupta, S Singla, G Zuzic - arXiv preprint arXiv:1911.07352, 2019 - arxiv.org
In classical secretary problems, a sequence of $ n $ elements arrive in a uniformly random
order, and we want to choose a single item, or a set of size $ K $. The random order model …

Tight revenue gaps among simple mechanisms

Y Jin, P Lu, ZG Tang, T Xiao - SIAM Journal on Computing, 2020 - SIAM
We consider a fundamental problem in microeconomics: selling a single item to a number of
potential buyers, whose values are drawn from known independent and regular (not …

Benchmark design and prior-independent optimization

J Hartline, A Johnsen, Y Li - 2020 IEEE 61st Annual …, 2020 - ieeexplore.ieee.org
This paper compares two leading approaches for robust optimization in the models of online
algorithms and mechanism design. Competitive analysis compares the performance of an …

Competitive auctions with imperfect predictions

P Lu, Z Wan, J Zhang - arXiv preprint arXiv:2309.15414, 2023 - arxiv.org
The competitive auction was first proposed by Goldberg, Hartline, and Wright. In their paper,
they introduce the competitive analysis framework of online algorithm designing into the …

Envy freedom and prior-free mechanism design

NR Devanur, JD Hartline, Q Yan - Journal of Economic Theory, 2015 - Elsevier
We consider the provision of an abstract service to single-dimensional agents. Our model
includes position auctions, single-minded combinatorial auctions, and constrained matching …

Smoothed analysis of multi-item auctions with correlated values

A Psomas, A Schvartzman, SM Weinberg - Proceedings of the 2019 …, 2019 - dl.acm.org
Consider a seller with m heterogeneous items for sale to a single additive buyer whose
values for the items are arbitrarily correlated. It was previously shown that, in such settings …

Revenue gaps for discriminatory and anonymous sequential posted pricing

P Dütting, FA Fischer, M Klimm - CoRR, 2016 - openreview.net
We consider the problem of maximizing the expected revenue from selling $ k $
homogeneous goods to $ n $ unit-demand buyers who arrive sequentially with independent …