Theory Seminar- Recent Developments in Combinatorial Auctions, Matt Weinberg (Princeton University)
/
Room 401B, 3401 Walnut
3401 Walnut Street, Philadelphia, PA, United States
Abstract: In a combinatorial auction there are m items, and each of n players has a valuation function v_i which maps sets of items to non-negative reals. A designer wishes to partition the items into S_1,…,S_n to maximize the welfare (\sum_i v_i(S_i) ), perhaps assuming that all v_i lie in some class V (such as […]

