Algorithms, Games, and Networks
January 31, 2013
Lecture 6
Lecturer: Avrim Blum
1
Scribe: Xiaowen Ding
Overview
In todays lecture, we have a conference talk[EC09]. We discuss Price of Uncertainty(PoU),
which describes the impact that small uctuations or a
Algorithms, Games, and Networks
February 5, 2013
Lecture 7
Lecturer: Avrim Blum
1
Scribe: Fan Xiang
Overview
Todays lecture is on Non-atomic selsh routing. Readings are 18.1, 18.2.1, 18.3.1,
18.4.1 in AGT.
2
Model
The non-atomic selsh routing problem can
Algorithms, Games, and Networks
February 7, 2013
Lecture 8
Lecturer: Ariel Procaccia
1
Scribe: Dong Bae Jun
Overview
In this lecture, we discuss the topic of social choice by exploring voting rules, axioms, and
applications. The following items are covere
Algorithms, Games, and Networks
February 12, 2013
Lecture 9
Lecturer: Ariel Procaccia
1
Scribe: Jeremy Karp
Overview
In the previous class, we discussed some basic ideas of social choice theory, including the
denitions and properties of a number of voting
Algorithms, Games, and Networks
February 14, 2013
Lecture 10
Lecturer: Ariel Procaccia
1
Scribe: Stylianos Despotakis
Overview
In the previous lecture, we discussed how we can use complexity as a barrier to avoid the
manipulation of a voting rule. In this
Algorithms, Games, and Networks
February 19, 2013
Lecture 11
Lecturer: Ariel Procaccia
1
Scribe: Chris McComb
Overview
We discuss several topics related to the concept of voting rules as Maximum Likelihood
Estimators (MLEs). These topics include:
Backgro
Algorithms, Games, and Networks
February 21, 2013
Lecture 12
Lecturer: Ariel Procaccia
1
Scribe: Sercan Yldz
Overview
In this lecture, we introduce the axiomatic approach to social choice theory. In particular, we
focus on the example of PageRank and stud
Algorithms, Games, and Networks
February 26, 2013
Lecture 1
Lecturer: Avrim Blum
1
Scribe: Jamie Morgenstern
Mechanism Design, Chapters 9.3, 9.5
Suppose the department has a spare printer, and would like to give it away to the person
who values it the mos
Algorithms, Games, and Networks
February 28, 2013
Lecture 14
Lecturer: Avrim Blum
1
Scribe: Hsu-Chun Hsiao
Overview
In this lecture we review the standard version of VCG using the Clark pivot rule, discuss
its applications and characteristics, and nally g
Algorithms, Games, and Networks
March 21, 2013
Lecture 17
Lecturer: Ariel Procaccia
1
Scribe: David Kurokawa
Setting and Model
Suppose we have a cake that is to be divided among several people and that people may
disagree on the value of portions of the c