Algorithmic Game Theory (Lecture 5: Revenue-Maximizing Auctions)

The challenge of revenue maximization. Bayesian optimal auctions.
Full course playlist: • Algorithmic Game Theor...
Book: www.amazon.com...
Lecture notes: timroughgarden....

[@sradpvv]

very good lecture ! thank you

[@flyingwings9969]

wonderful info, but board is not visible properly

[@MaziarShamsipour]

I didn't understand why being DSIC is not a barrier to optimality. Isn't it possible that another auction without being DSIC leads to a higher revenue?

[@timroughgardenlectures1861]

A priori, that's a possibility. But the full version of Myerson's analysis --- which is similar to the one in this lecture, with deviations from a dominant strategy replaced by deviations from a Bayes-Nash equilibrium --- shows that, in single-parameter settings, even if you optimize over the space of all (not necessarily DSIC) auctions, there is always a revenue-maximizing one that is DSIC.

[@bfyguy]

Loving the lectures but writing down notes is a serious nightmare

[@nitishsandhu4462]

You don't need to. Just download the pdf's from here theory.stanford.edu/~tim/f13/f13.html

[@flyingwings9969]

@@nitishsandhu4462 very thanks for sharing the link..

[@zishuozhao3874]

A good understanding of "capitalist pouring milk" XDDD

[@x0cx102]

What are you talking about

[@ehsaneshaghi1831]

The boy who raise hand frequently is really distracting.
There should be some specific times for asking questions.

[@harveywang8020]

There is always a boy in a classroom doing this.

[@vidursingh2749]

He is (presumably) paying to be in this class. You are watching it for free on RUclips. Ergo, you are really not in a position to complain :)

[@x0cx102]

@@vidursingh2749 well said