Making Decisions under Outcome Performativity

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


Duration: 26:33
66 views
0

Authors: Michael P. Kim, Juan C. Perdomo (UC Berkeley)
ITCS - Innovations in Theoretical Computer Science



Other Videos By Simons Institute for the Theory of Computing


2023-01-04Vertex Sparsification for Edge Connectivity in Polynomial Time
2023-01-04Extremal Combinatorics, iterated pigeonhole arguments, and generalizations of PPP
2023-01-04Fractional certificates for bounded functions
2023-01-04Expander Decomposition in Dynamic Streams
2023-01-04PPP-Completeness and Extremal Combinatorics
2023-01-04Incompressiblity and Next-Block Pseudoentropy
2023-01-04Beeping Shortest Paths via Hypergraph Bipartite Decomposition
2023-01-04Unitary property testing lower bounds by polynomials
2023-01-04Quantum space, ground space traversal, and how to embed multi-prover...
2023-01-04Necessary Conditions in Multi-Server Differential Privacy
2023-01-04Making Decisions under Outcome Performativity
2023-01-04A New Conjecture on Hardness of Low-Degree 2-CSP’s with...
2023-01-04On Interactive Proofs of Proximity with Proof-Oblivious Queries
2023-01-04Quantum algorithms and the power of forgetting
2023-01-04Exact Completeness of LP Hierarchies for Linear Codes
2023-01-04Learning versus Pseudorandom Generators in Constant Parallel Time
2023-01-04Strategyproof Scheduling with Predictions
2023-01-03Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks
2023-01-03Improved Monotonicity Testers via Hypercube Embeddings
2023-01-03Opponent Indifference in Rating Systems: A Theoretical Case for Sonas
2023-01-03Online Learning and Bandits with Queried Hints


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing