Knightian auctions
We study single-good auctions in a setting where each player knows his own valuation only within a constant multiplicative factor δ ∈ (0, 1), and the mech- anism designer knows δ. The classical notions of implementation in dominant strategies and implementation in undominated strategies are naturall...
Main Authors: | Chiesa, Alessandro, Micali, Silvio, Zhu, Zeyuan Allen |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
© Massachusetts Institute of Technology
2022
|
Online Access: | https://hdl.handle.net/1721.1/141764 |
Similar Items
-
A Social-Welfare Optimal Probabilistic Mechanism for Knightian Single-Good Auctions
by: Chiesa, Alessandro, et al.
Published: (2012) -
Knightian Analysis of the Vickrey Mechanism
by: Chiesa, Alessandro, et al.
Published: (2016) -
Mechanism Design With Approximate Player Types
by: Chiesa, Alessandro, et al.
Published: (2011) -
Bridging Utility Maximization and Regret Minimization
by: Chiesa, Alessandro, et al.
Published: (2013) -
Mechanism Design with Approximate Valuations
by: Chiesa, Alessandro, et al.
Published: (2011)