Algorithmic Game Theory
7Delegated Stochastic Probing
Curtis Bechtel (University of Southern California), Shaddin Dughmi (University of Southern California)
Relaxing Common Belief for Social Networks
Noah Burrell (University of Michigan), Grant Schoenebeck (University of Michigan)
Approximately Strategyproof Tournament Rules in the Probabilistic Setting
Kimberly Ding (Princeton University), S. Matthew Weinberg (Princeton University)
Pipeline Interventions
Eshwar Ram Arunachaleswaran (University of Pennsylvania), Sampath Kannan (University of Pennsylvania), Aaron Roth (University of Pennsylvania), Juba Ziani (University of Pennsylvania)
Learning and Strongly Truthful Multi-task Setting Peer Prediction: A Variational Approach
Grant Schoenebeck (University of Michigan), Fang-Yi Yu (Harvard University)
ITCS 2021
Other Videos By Simons Institute for the Theory of Computing
| 2021-01-15 | Pseudorandom Generators for Unbounded-Width Permutation Branching Programs |
| 2021-01-15 | Sharp Threshold Rates for Random Codes |
| 2021-01-15 | The Complexity of Finding Fair Independent Sets in Cycles |
| 2021-01-15 | Algorithmic Persuasion with Evidence |
| 2021-01-15 | Comparing computational entropies below majority (or: When is the dense model theorem false?) |
| 2021-01-15 | The entropy of lies: playing twenty questions with a liar |
| 2021-01-12 | Error Correcting Codes for Uncompressed Messages |
| 2021-01-12 | Algorithms and Hardness for Multidimensional Range Updates and Queries |
| 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 |