Simple Mechanisms for a (Sub)Additive Buyer

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


Duration: 34:50
275 views
1

Matt Weinberg, Princeton University
Complexity and Simplicity in Economics
https://simons.berkeley.edu/talks/matt-weinberg-10-12



Other Videos By Simons Institute for the Theory of Computing


2015-10-19The Substitution Metric and the Performance of Clock Auctions
2015-10-19Decision Making at Scale: Algorithms, Mechanisms, and Platforms
2015-10-19On Maximizing Revenue for Multi-Item Auctions
2015-10-19Complexity in AGT Update: Nash Approximability and Simultaneous Auctions
2015-10-19Non-Revelation Mechanism Design: Inference, Optimization, and Approximation
2015-10-19Obviously Strategy-Proof Mechanisms
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-19The Query Complexity of Correlated Equilibria
2015-10-19Econometrics for Learning Agents
2015-10-19Robustness and Separation in Multidimensional Mechanism Design
2015-10-19First Price Auctions with General Information Structures: Implications for Bidding and Revenue
2015-10-19Revenue Maximization in Interdependent Value Settings
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


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Economics and Computation
Matt Weinberg