Simplicity and Optimality in Algorithmic Economics

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


Duration: 15:16
830 views
12

Divyarthi Mohan (Tel Aviv University)
https://simons.berkeley.edu/talks/simplicity-and-optimality-algorithmic-economics
Meet the Fellows Welcome Event Fall 2022

In many problems at the intersection of economics and computation, there are strategic agents whose interests may not align with those of an algorithm designer. This misalignment of interests may increase the complexity of otherwise simpler algorithmic questions. More generally, understanding the complex behaviors and interactions of strategic agents is crucial to design better algorithms (or mechanisms). In this talk I will briefly highlight my work in 1) designing simple mechanisms that are approximately optimal, and 2) understanding the effects of simple "anecdotal" communication between strategic agents.



Other Videos By Simons Institute for the Theory of Computing


2022-09-14Best of Both World Algorithms from I.I.D. to Adversarial Data
2022-09-14Corruption-Robust Contextual Search
2022-09-14Contextual Inverse Optimization: Offline and Online Learning
2022-09-13Causal Inference in Complex Systems: Network Interference, Strategic Agents, and Beyond
2022-09-13Inference and Interference in Marketplace Experimentation
2022-09-13Causal Matrix Completion: Applications to Offline Causal Reinforcement Learning
2022-09-13Greedy Approximation Algorithms for Active Sequential Hypothesis Testing
2022-09-13Expert Advice in Complex Environments
2022-09-12Retrospective Search: Exploration and Ambition on Uncharted Terrain
2022-09-12Dynamically Aggregating Diverse Information
2022-09-10Simplicity and Optimality in Algorithmic Economics
2022-09-10Algorithms Using Local Graph Features to Predict Epidemics
2022-09-10Beyond Worst Case Analysis in ML
2022-09-09Pseudorandom Generators and Small-Space Derandomization
2022-09-09Competitive Control
2022-09-09Machine Learning on Large-Scale Graphs
2022-09-09Adaptive Online Learning without Prior Knowledge
2022-09-09Incentive-Aware Machine Learning
2022-09-09How Robust Is the Gittins Index? A Queueing Case Study
2022-09-09Quantum Scientific Computation
2022-09-09Quantum Algorithms for Hamiltonian Simulation with Unbounded Operators


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Meet the Fellows Welcome Event Fall 2022
Divyarthi Mohan