Date of Original Version
International Workshop on Computational Social Choice (COMSOC) and at the DIMACS-LAMSADE conference on Algorithmic Decision Theory.
Abstract or Table of Contents
A recent trend (especially in electronic commerce) is higher levels of expressiveness in the mechanisms that mediate interactions such as auctions, exchanges, catalog offers, voting systems, matching of peers, and so on. Participants can express their preferences in drastically greater detail than ever before. In many cases this trend is fueled by modern algorithms for winner determination that can handle the richer inputs.
But is more expressiveness always a good thing? What forms of expressiveness should be offered?
In this talk I will ﬁrst report on our experience from over $40 billion of combinatorial multi-attribute sourcing auctions. Then, I will present recent theory that ties the expressiveness of a mechanism to an upper bound on efﬁciency in a domain-independent way in private-information settings. Time permitting, I will also discuss theory and experiments on applying expressiveness to ad auctions, such as sponsored search and real-time banner ad auctions with temporal span and complex preferences.