Conference
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
Experiments on deliberation equilibria in 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
Sequences of take-it-or-leave-it offers: Near-optimal auctions without full valuation revelation
Solving combinatorial exchanges: Optimality via a few partial bids
Using performance profile trees to improve deliberation control