Berkeley's
EconCS Seminar

We gather weekly to discuss topics at the intersection of economics and computer science.

We will meet on Tuesdays at 12:30 during the Fall 2010 semester.
410 Hearst Mining building.



Fall 2010

Sep 07 | Dafna Shahaf  on Connecting the Dots between News Articles

Sep 21 | Elliot Anshelevich  on Contribution Games in Social Networks

Oct 05 | Ron Berman  on The Role of Search Engine Optimization in Search Advertisings



Spring 2010

Jan 26 | Nicholas Economides  on Net Neutrality on the Internet

Feb 02 | Yaron Singer  on New Results on Incentives and Computation in Combinatorial Public Projects

Feb 09 | Edo Liberty  on Reduction of Clustering to Learning

Feb 16 | Shaddin Dughmi  on the Power of Randomization in Algorithmic Mechanism Design

Feb 23 | Maciej Kotowski on First-Price Auctions and Budget Constrained Bidders

Mar 02 | Omer Tamuz on Bayesian Gaussian Estimator Networks

Mar 09 | Elad Hazan on How hard is it to approximate the best Nash equilibrium?

Mar 30 | Christos Papadimitriou on Optimal Auctions

Apr 06 | Michael Ostrovsky on Information Aggregation in Dynamic Markets with Strategic Traders

Apr 13 | Amos Fiat on Combinatorial Auctions with Budgets

Apr 20 | John Hegeman on Facebook Ad Auctions

Apr 27 | Yash Kanoria on Fast Convergence of Natural Bargaining Dynamics in Exchange Networks

May 04| Shahar Dobzinski on Multi-Unit Auctions



Fall 2009

Sep 04 | Mukund Sundararajan on Utility-Maximizing Privacy Mechanisms

Sep 11 | Nicolas Lambert on Eliciting Information on the Distribution of Uncertain Future Outcomes

Sep 18 | Jake Abernethy on Repeated Games against Budgeted Adversaries

Sep 25 | Chris Wilkens on Complexity Equilibria and Intractability in Production Economies

Oct 02 | Shachar Kariv on Archetypes and Polytypes in Decisions under Uncertainty

Oct 09 | Adam Szeidl on Measuring Trust in Peruvian Shantytowns

Oct 16 | Paul Valiant on How to Design Profitable Auctions

Oct 23 | Christos Papadimitriou on The Complexity of Harsanyi-Selten Equilibrium Selection

Oct 30 | Greg Valiant on A New Economic Model of the Internet

Nov 04 | Yury Lifshits on Evolution of Two-sided Markets

Nov 13 | Lars Backstrom on Group Formation in Large Social Networks: Membership, Growth, and Evolution

Dec 04 | Ittai Abraham on Upper and Lower Bounds for Mediator Implementation with Cheap Talk



Spring 2009

 Jan 29 | Christos Papadimitriou on Algorithmic Game Theory

Feb 05 | Shachar Kariv on Theory and Experiment of Trading in Networks

Feb 12 | Adam Szeidl on Auctions with Behavioral Agents

Feb 19 | Michael Schapira on Best Reply Mechanisms

Feb 26 | Brian Rogers

Mar 05 | Liad Blumrosen on Posted Prices vs. Negotiations

Mar 12 | Uri Nadav on the Convergence of Regret Minimization Dynamics in Concave Games

Mar 19 | David Ahn on Combinatorial Voting

Mar 26 | Spring Break

Apr 02  | Christos Papadimitiriou on Impossibility Theorems for Price Mechanisms

Apr 09  | Greg Valiant on Improving the Price of Anarchy

Apr 16  | Moshe Babaioff on Auctions with Online Supply

Apr 23  | Maciej Kotowski on Voucher Auctions

Apr 30  | Michael Schwarz

May 07 | Yaron Singer on Truthful Approximations under a Budget