econcs

Topics on the border of CS, Game theory, and Economics

 

Administrative

 

Instructors:

 

Noam Nisan: noam@cs.huji.ac.il. Office: Ross building room 218. Office hour: Tuesday 11-12.

 

Motty Perry: motty@math.huji.ac.il

 

Time & Place:

 

Tuesday 12:00 to 1:45, Feldman building, third floor, "Eilat" Room

 

Schedule

 

 

Date

Speaker

Topic

Slides

6.3

Noam

CS and Economics????

----

13.3

Motty

Introduction to Mechanism Design

----

20.3

 

Shai Roitman

Paper 2: Combinatorial auctions

PPT format

27.3

Oren Rigbi & Damian Goren

Paper 20: Dynamic Auction

PPT Format

Pesach

---------------------

.

.

17.4

Alina Blizhovsky

Paper 10: Strategyproofness via LP Duality

PPT Format

24.4

Yehuda Arav

Paper 6: Pricing and Congestion Control

PPT Format

1.5

Tomer Bar-Zeev & Wolff Gil

paper 19: Last minute bidding

PPT Format

8.5

Liad Blumrosen

Paper 1: submodular & multicast

PPT Format

15.5

Raffi Margaliot

Paper 8: privacy-preserving auctions

PPT Format

Yom student

---------------------

.

.

29.5

Alexander Kogan

Paper 3: Selfish Routing & Stackelberg

Part 1(PPT Format) and Part 2(PPT Format)

5.6

Udi Wieder

Paper 4: Bounded rationality

PPT Format

12.6

Avner Zaitlin

Paper 15: Efficient auctions

PPT Format

19.6

Keren Horowitz & Ziv Yirmeyahu

paper 5: Competitive auctions A & B

PPT Format

 

 

Papers to be presented

 

You may choose one of the papers (or pair of related papers) listed below. You may alternatively suggest another paper from recent conferences or from a course in another university on the same topic. “Kol-hokodem zocheh” in terms of choosing papers and dates.

 

  1. Strategy-proof sharing of submodular costs by H. Moulin and S. Shenker and Sharing the Cost of Multicast Transmissions by Joan Feigenbaum, Christos Papadimitriou and Scott Shenker.
  2. Combinatorial auctions: a survey by Sven de Vries and Rakesh Vohra.
  3. How Bad is Selfish Routing? by Roughgarden and Tardos and Stackelberg Scheduling by Roughgarden
  4. Bounded Rationality and Computational Complexity by Papadimitriou and Yannakakis
  5. Competitive Auctions and Digital Goods by Andrew V. Goldberg, Jason D. Hartline, and Andrew Wright and Competitive Auctions for Multiple Digital Goods by Andrew V. Goldberg and Jason D. Hartline
  6. Resource Pricing and the Evolution of Congestion Control by Gibbens and Kelly
  7. Rational Learning and Nash Equilibrium by Kalai and Lehrer
  8. Privacy-Preserving Auctions and Mechanism Design by Moni Naor, Benny Pinkas, and Reuben Sumner
  9. Economic incentives in software design, Chapter 3 by Hal Varian
  10. Strategyproofness via LP Duality by Jain and V. Vazirani
  11. Truth Revelation in Rapid, Approximately Efficient Combinatorial Auctions" by Daniel Lehmann, Liadan O'Callaghan and Yoav Shoham
  12. Distributed Rational Decision Making (survey) by T. Sandholm
  13. Learning and Implementation on the Internet by E. Freidman and S. Shenker
  14. Putting Auction Theory to Work: Ascending Auctions with Package Bidding by Paul Milgrom
  15. Efficient Auctions by P. Dasgupta and E. Maskin
  16. Implementation Theory by E. Maskin and T. Sjostrom
  17. Efficiency and Information Aggregation and Strategic Voting by W. Pesendorfer and M.Swinkels
  18. Convergence to Efficiency in A Simple Market with Incomplete Information by A. Rustichini, M. Satterthwaite and S. Williams and The optimality of a simple market mechanism by M. Satterthwaite and S. Williams
  19. Last Minute Bidding and the Rules for Ending Second-Price Auctions: Theory and Evidence from Natural Experiment on the Internet by A. Roth, and A. Ockenfels
  20. An Efficient Dynamic Auction for Heterogeneous Commodities by L. Ausubel
  21. Efficient Design with Interdependent Valuations by Philippe Jehiel and Benny Moldovanu

 

 

Links to related courses elsewhere