Competition and Simple Auctions

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,900
Published on ● Video Link: https://www.youtube.com/watch?v=ytlSDUxF988


Duration: 32:40
275 views
1

Mallesh Pai, University of Pennsylvania
Complexity and Simplicity in Economics
https://simons.berkeley.edu/talks/mallesh-pai-10-14



Other Videos By Simons Institute for the Theory of Computing


2015-10-19Strong Duality for a Multiple Good Monopolist
2015-10-19Selling Experiments
2015-10-19Timing “Versus” Matching: Thickness and Information in Dynamic Markets
2015-10-19The Emergent Structure of Simple Behaviors in Complex Networks
2015-10-19Simple Mechanisms for a (Sub)Additive Buyer
2015-10-19Algorithmic Bayesian Mechanism Design
2015-10-19Consensus Expectations and Conventions
2015-10-19Privacy, Substitutes, and Optimization in Deferred-Acceptance Clock Auctions
2015-10-19Dynamics of Evolving Social Groups
2015-10-19On the Borders of Border’s Theorem
2015-10-19Competition and Simple Auctions
2015-10-08Thinking Algorithmically About Impossibility
2015-10-01Satisfiability Algorithms Based on Concentrated Shrinkage
2015-10-01Generalizations of the Gate Elimination Method
2015-10-01Addition is Exponentially Harder than Counting for Shallow Monotone Circuits
2015-10-01Graph Automorphism and Circuit Size
2015-10-01On the Power of Gradually Increasing Independence
2015-10-01Local Reductions
2015-10-01Explicit Two-Source Extractors and Resilient Functions
2015-10-01Lower Bounds by Birkhoff Interpolation
2015-10-01On the Existence of Optimal Algorithms


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Economics and Computation
Mallesh Pai