Combinatorial Auctions Book

	Foreword
	Introduction to combinatorial auctions	1
1	The lovely but lonely Vickrey auction	17
2	Iterative combinatorial auctions	41
3	Ascending proxy auctions	79
4	Simultaneous ascending auctions	99
5	The clock-proxy auction : a practical combinatorial auction design	115
6	PAUSE : a computationally tractable combinatorial auction	139
7	Pseudonymous bidding in combinatorial auctions	161
8	From the assignment model to combinatorial auctions	189
9	Bidding languages for combinatorial auctions	215
10	Preference elicitation in combinatorial auctions	233
11	The communication requirements of combinatorial allocation problems	265
12	The winner determination problem	297
13	Tractable cases of the winner determination problem	319
14	Optimal winner determination algorithms	337
15	Incentive compatibility in computationally feasible combinatorial auctions	369
16	Noncomputational approaches to mitigating computational problems in combinatorial auctions	395
17	Observations and near-direct implementations of the ascending proxy auction	415
18	A test suite for combinatorial auctions	451
19	Empirical hardness models for combinatorial auctions	479
20	Auctions for the safe, efficient, and equitable allocation of airspace system resources	507
21	Combinatorial auctions for truckload transportation	539
22	Auctioning bus routes : the London experience	573
23	Industrial procurement auctions	593