
Algorithmic game theory
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=vXoOA3AmLeM
How to Sell Information Optimally: an Algorithmic Study
Yang Cai (Yale University), Grigoris Velegkas (Yale University)
Buying Data Over Time: Approximately Optimal Strategies for Dynamic Data-Driven Decisions
Nicole Immorlica (Microsoft Research), Ian Kash (UIC), Brendan Lucier (Microsoft Research)
Algorithmic Persuasion with Evidence
Martin Hoefer (Goethe University Frankfurt), Pasin Manurangsi (Google Research), Alexandros Psomas (Purdue University)
Non-quasi-linear Agents in Quasi-linear Mechanisms
Moshe Babaioff (Microsoft Research), Richard Cole (NYU), Jason Hartline (Northwestern University), Nicole Immorlica (Microsoft Research), Brendan Lucier (Microsoft Research)
ITCS 2021
Other Videos By Simons Institute for the Theory of Computing
2021-01-12 | Algebraic and circuit complexity |
2021-01-12 | Online and streaming algorithms |
2021-01-12 | Algorithmic Game Theory |
2021-01-12 | Optimization |
2021-01-12 | Codes and information |
2021-01-12 | Machine Learning |
2021-01-11 | Circuits and communication |
2021-01-10 | Graph algorithms |
2021-01-10 | Algorithms |
2021-01-10 | GRADUATING BITS |
2021-01-10 | Algorithmic game theory |
2021-01-10 | Quantum information |
2021-01-10 | Quantum |
2021-01-09 | Analytic methods |
2021-01-09 | Computational complexity |
2021-01-08 | Distributed models |
2021-01-08 | Pseudorandomness |
2021-01-08 | Crypto and Privacy |
2021-01-08 | Matchings |
2021-01-08 | Introductory Remarks |
2020-12-28 | David Harold Blackwell Summer Research Institute | Interview with Jelani Nelson |
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
itcs2021