Conference
(Im)Possibility of Unconditionally Privacy-Preserving Auctions
Communication complexity as a lower bound for learning in games
Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions
Eliciting bid taker non-price preferences in (combinatorial) auctions
Learning near-Pareto-optimal conventions in polynomial time
Self-interested automated mechanism design and implications for optimal combinatorial auctions
Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation