We propose a new proxy bidding mechanism to allocate courses to students given students' reported preferences. Our mechanism is motivated by a specific strategic downgrading m...
Scott Duke Kominers, Mike Ruberry, Jonathan Ullman
Proxy bidding has been proposed for combinatorial auctions as a means to speed up the auctions, to simplify the user interface, and to limit strategic behavior. The only previousl...
Iterative auctions have many computational advantages over sealed-bid auctions, but can present new possibilities for strategic manipulation. We propose a two-stage technique to m...
We consider auction design in a setting with costly preference elicitation. Well designed auctions can help to avoid unnecessary elicitation while determining efficient allocations...
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...