CS364B: Frontiers in Mechanism Design Lecture #1: Ascending and Ex Post Incentive Compatible Mechanisms∗

نویسنده

  • Tim Roughgarden
چکیده

These twenty lectures cover advanced topics in mechanism design. They assume familiarity with some of the material covered in the instructor’s CS364A course — specifically, lectures 2–4 and 7–9. Recall that mechanism design is the “science of rule-making.” The goal is to understand how to design systems with strategic participants — autonomous decision-makers whose objectives are generally different from the the designer’s — that have good performance guarantees. For example, a mechanism designer might want to compute a socially efficient allocation of scarce resources or raise significant revenue, while a mechanism participant only cares about its own utility.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cs364b: Frontiers in Mechanism Design Lecture #2: Unit-demand Bidders and Walrasian Equilibria * 1 Bidders with Unit-demand Valuations 1.1 the Setting

Last lecture we discussed two simple auction scenarios — identical items with unit-demand bidders, and non-identical items with bidders with additive valuations. In both scenarios, we gave an ascending auction that is ex post incentive compatible (EPIC) — meaning sincere bidding by every bidder is an ex post Nash equilibrium (EPNE) with guaranteed non-negative utility — and that maximizes the w...

متن کامل

Cs364b: Frontiers in Mechanism Design Lecture #7: Submodular Valuations

With this lecture we commence Part II of the course. We continue to pursue very strong incentive guarantees (i.e., DSIC mechanisms) in scenarios where the underlying welfaremaximization problem is NP-hard. This turns out to be a very difficult quest; the goal of this part of the course is to highlight the challenges involved and survey what few design techniques and positive results are known. ...

متن کامل

CS364B: Frontiers in Mechanism Design Lecture #14: The Price of Anarchy in Simple Auctions

With this lecture we commence the fourth part of the course. In the last two parts we took incentive constraints, like DSIC or BIC, as a hard constraint, and subject to this designed the best mechanisms possible. Most of the mechanisms discussed were quite complex — interesting as proofs of concept of what is possible in principle, but not suitable for actual use. This part of the course insist...

متن کامل

CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding∗

Recall that the submodularity condition in (1) is a form of diminishing returns, but is strictly weaker than the gross substitute condition. If we ignore incentives and assume straightforward bidding, the Kelso-Crawford auction achieves a 1 2 -approximation of the optimal welfare. Another 1 2 -approximation is given in Exercise #25. Are there DSIC mechanisms with equally good guarantees? While ...

متن کامل

CS364B: Frontiers in Mechanism Design Lecture #18: Multi-Parameter Revenue-Maximization∗

With this lecture we commence the fifth and final part of the course. All previous lectures focused on the objective of maximizing the welfare ∑n i=1 vi(Si) of an auction. In these last three lectures, we study the objective of maximizing the revenue ∑n i=1 pi of an auction. Of course, all of the auctions that we’ve studied to generate revenue, but only as a side effect of the quest for incenti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014