Prior-independent mechanism

A Prior-independent mechanism (PIM) is a mechanism in which the designer knows that the agents' valuations are drawn from some probability distribution, but does not know the distribution.

A typical application is a seller who wants to sell some items to potential buyers. The seller wants to price the items in a way that will maximize his profit. The optimal prices depend on the amount that each buyer is willing to pay for each item. The seller does not know these values, but he assumes that the values are random variables with some unknown probability distribution.

A PIM usually involves a random sampling process. The seller samples some valuations from the unknown distribution, and based on the samples, constructs an auction that yields approximately-optimal profits. The major research question in PIM design is: what is the sample complexity of the mechanism? I.e, how many agents it needs to sample in order to attain a reasonable approximation of the optimal welfare?

Single-item auctions

The results in ^[1] imply several bounds on the sample-complexity of revenue-maximization of single-item auctions:^[2]

For a $1/4$ -approximation of the optimal expected revenue, the sample-complexity is $1$ - a single sample suffices. This is true even when the bidders are not i.i.d.^[3]
For a $1-\epsilon$ -approximation of the optimal expected revenue, when the bidders are i.i.d OR when there is an unlimited supply of items (digital goods), the sample-complexity is $O(1/\epsilon ^{2})$ when the agents' distributions have monotone hazard rate, and $O(1/\epsilon ^{3})$ when the agents' distributions are regular but do not have monotone-hazard-rate.

The situation becomes more complicated when the agents are not i.i.d (each agent's value is drawn from a different regular distribution) and the goods have limited supply. When the agents come from $k$ different distributions, the sample complexity of $1-\epsilon$ -approximation of the optimal expected revenue in single-item auctions is:^[2]

at most $O({k^{10} \over \epsilon ^{7}}\ln ^{3}{k \over \epsilon })$ - using a variant of the empirical Myerson auction.
at least $\Omega ({k \over {\sqrt {\epsilon \ln k}}})$ (for monotone-hazard-rate regular valuations) and at least $\Omega ({k \over \epsilon })$ (for arbitrary regular valuations).

Single-parametric agents

^[4] discuss arbitrary auctions with single-parameter utility agents (not only single-item auctions), and arbitrary auction-mechanisms (not only specific auctions). Based on known results about sample complexity, they show that the number of samples required to approximate the maximum-revenue auction from a given class of auctions is:

O{\bigg (}({H \over \epsilon })^{2}(D\ln({H \over \epsilon })+\ln({1 \over \delta })){\bigg )}

where:

the agents' valuations are bounded in $[1,H]$ ,
the pseudo-VC dimension of the class of auctions is at most $D$ ,
the required approximation factor is $1-\epsilon$ ,
the required success probability is $1-\delta$ .

In particular, they consider a class of simple auctions called $t$ -level auctions: auctions with $t$ reserve prices (a Vickrey auction with a single reserve price is a 1-level auction). They prove that the pseudo-VC-dimension of this class is $O(nt\ln(nt))$ , which immediately translates to a bound on their generalization error and sample-complexity. They also prove bounds on the representation error of this class of auctions.

Multi-parametric agents

Devanur et al study a market with different item types and unit demand agents.^[5]

Chawla et al study PIMs for the makespan minimization problem.^[6]

Hsu et al study a market with different item types. The supplies are fixed. The buyers can buy bundles of items, and have different valuations on bundles. They prove that, if $n$ buyers are sampled independently from some unknown distribution, an optimal price-vector is calculated, and this price-vector is then applied to a fresh sample of $n$ buyers, then the social welfare is approximately optimal. The competitive ratio implied by their Theorem 6.3 is, with probability $1-\delta$ , at least

1-O{\bigg (}{\sqrt {h^{3}n^{0.5}m^{4}\ln ^{2}m\ln ^{2}{1 \over \delta } \over {\text{OptimalWelfare}}}}{\bigg )}

.^[7]

Alternatives

Prior-independent mechanisms (PIM) should be contrasted with two other mechanism types:

Bayesian-optimal mechanisms (BOM) assume that the agents' valuations are drawn from a known probability distribution. The mechanism is tailored to the parameters of this distribution (e.g., its median or mean value).
Prior-free mechanisms (PFM) do not assume that the agents' valuations are drawn from any probability distribution (known or unknown). The seller's goal is to design an auction that will produce a reasonable profit even in worst-case scenarios.

From the point-of-view of the designer, BOM is the easiest, then PIM, then PFM. The approximation guarantees of BOM and PIM are in expectation, while those of PFM are in worst-case.

References

^ Dhangwatnotai, Peerapong; Roughgarden, Tim; Yan, Qiqi (2015). "Revenue maximization with a single sample". Games and Economic Behavior. 91: 318–333. doi:10.1016/j.geb.2014.03.011.
^ ^a ^b Cole, Richard; Roughgarden, Tim (2014). "The sample complexity of revenue maximization". Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14. p. 243. arXiv:1502.00963. doi:10.1145/2591796.2591867. ISBN 9781450327107.
^ Hartline, Jason D.; Roughgarden, Tim (2009). "Simple versus optimal mechanisms". Proceedings of the tenth ACM conference on Electronic commerce - EC '09. p. 225. doi:10.1145/1566374.1566407. ISBN 9781605584584.
^ On the Pseudo-Dimension of Nearly Optimal Auctions. NIPS. 2015. arXiv:1506.03684. Bibcode:2015arXiv150603684M.
^ Devanur, Nikhil; Hartline, Jason; Karlin, Anna; Nguyen, Thach (2011). "Prior-Independent Multi-parameter Mechanism Design". Internet and Network Economics. Lecture Notes in Computer Science. Vol. 7090. p. 122. CiteSeerX 10.1.1.259.3224. doi:10.1007/978-3-642-25510-6_11. ISBN 978-3-642-25509-0.
^ Chawla, Shuchi; Hartline, Jason D.; Malec, David; Sivan, Balasubramanian (2013). "Prior-independent mechanisms for scheduling". Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13. p. 51. arXiv:1305.0597. doi:10.1145/2488608.2488616. ISBN 9781450320290.
^ Hsu, Justin; Morgenstern, Jamie; Rogers, Ryan; Roth, Aaron; Vohra, Rakesh (2016). "Do prices coordinate markets?". Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016. p. 440. arXiv:1511.00925. doi:10.1145/2897518.2897559. ISBN 9781450341325.

[dhang15-1] Dhangwatnotai, Peerapong; Roughgarden, Tim; Yan, Qiqi (2015). "Revenue maximization with a single sample". Games and Economic Behavior. 91: 318–333. doi:10.1016/j.geb.2014.03.011.

[cr15-2] Cole, Richard; Roughgarden, Tim (2014). "The sample complexity of revenue maximization". Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14. p. 243. arXiv:1502.00963. doi:10.1145/2591796.2591867. ISBN 9781450327107.

[hr09-3] Hartline, Jason D.; Roughgarden, Tim (2009). "Simple versus optimal mechanisms". Proceedings of the tenth ACM conference on Electronic commerce - EC '09. p. 225. doi:10.1145/1566374.1566407. ISBN 9781605584584.

[4] On the Pseudo-Dimension of Nearly Optimal Auctions. NIPS. 2015. arXiv:1506.03684. Bibcode:2015arXiv150603684M.

[dhkn11-5] Devanur, Nikhil; Hartline, Jason; Karlin, Anna; Nguyen, Thach (2011). "Prior-Independent Multi-parameter Mechanism Design". Internet and Network Economics. Lecture Notes in Computer Science. Vol. 7090. p. 122. CiteSeerX 10.1.1.259.3224. doi:10.1007/978-3-642-25510-6_11. ISBN 978-3-642-25509-0.

[6] Chawla, Shuchi; Hartline, Jason D.; Malec, David; Sivan, Balasubramanian (2013). "Prior-independent mechanisms for scheduling". Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13. p. 51. arXiv:1305.0597. doi:10.1145/2488608.2488616. ISBN 9781450320290.

[hmrrv16-7] Hsu, Justin; Morgenstern, Jamie; Rogers, Ryan; Roth, Aaron; Vohra, Rakesh (2016). "Do prices coordinate markets?". Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016. p. 440. arXiv:1511.00925. doi:10.1145/2897518.2897559. ISBN 9781450341325.

[1]

[2]

[3]

[4]

[5]

[6]

[7]