The Complexity of Computing a Tarski Fixed Point of a Monotone Function, With Applications to Games

Channel:

Subscribers:

68,700

Published on February 27, 2021 6:11:54 AM ● Video Link: https://www.youtube.com/watch?v=i9bH5jwwy7s

Duration: 1:02:21

657 views

Other Videos By Simons Institute for the Theory of Computing

2021-03-08	TBA
2021-03-05	Designing Agents' Preferences, Beliefs, and Identities
2021-03-04	On Symmetry and Quantification: A New Approach to Verify Distributed Protocols
2021-03-04	Progress in Symbolic Satisfiability Solving
2021-03-03	Fault Tolerance with LDPC Codes \| Quantum Colloquium
2021-03-02	Embracing the Uncertainties
2021-03-01	CounterExample Guided Inductive Synthesis Modulo Theories
2021-03-01	Syntax-Guided Synthesis in SMT: A View from Inside the Solver
2021-03-01	Data-Driven Inference of Representation Invariants
2021-03-01	Neural Network guided Grammar Filtering For Syntax-Guided Synthesis
2021-02-26	The Complexity of Computing a Tarski Fixed Point of a Monotone Function, With Applications to Games
2021-02-25	Richard M. Karp Distinguished Lecture — Automated Formal Program Repair
2021-02-25	Quantum Algorithmic Measurements \| Quantum Colloquium
2021-02-25	Encodings Showcase
2021-02-24	Deep Dive into CDCL Pseudo-Boolean Solvers (focusing on the implementation in Sat4j)
2021-02-23	Quantum Algorithms for Hamiltonian Simulation \| Quantum Colloquium
2021-02-22	Syntax-Guided Program Synthesis
2021-02-19	Rational Synthesis
2021-02-18	On the Usefulness of the Strong Exponential Time Hypothesis
2021-02-18	Total Function Problems in the Polynomial Hierarchy
2021-02-17	Combining SAT and Computer Algebra for Circuit Verification

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Games and Equilibria in System Design and Analysis

Kousha Etessami