Computer Software
Print ISSN : 0289-6540
Game Theory for Computer Scientist—Mechanism Design (Advanced)—
Makoto YOKOOAtsushi IWASAKIYuko SAKURAIYoshio OKAMOTO
Author information
JOURNAL FREE ACCESS

2013 Volume 30 Issue 1 Pages 1_34-1_52

Details
Abstract
This tutorial focuses on designing a mechanism that achieves a socially desirable outcome or a goal of the designer that arises from some practical demands, as several advanced topics on mechanism design theory. We first briefly explains the theory of combinatorial auctions via the most well-known Vickrey-Clarke-Groves mechanism. Second, as an example that designs a new mechanism for a practical demand, we introduce false-name bids and illustrate how we improve a trivial robust mechanism against false-name bids. Furthermore, we explore models and several theoretical results on mechanisms of a keyword auction and a two-sided matching as other well-known topics of mechanism design theory.
Content from these authors
© 2013 Japan Society for Software Science and Technology
Previous article Next article
feedback
Top