Simons Institute Courses

Consistency, Acyclicity, and Positive Semirings

Explore local vs. global consistency in probability distributions and relational databases, generalizing results using K-relations over positive semirings and acyclic hypergraphs.

• YouTube
• 38 minutes
• On-Demand
• Free Video

Semiring-Based Soft Constraint Solving and Argumentation

Explore semiring applications in constraint solving and argumentation, focusing on optimizing solutions beyond traditional problem-solving approaches.

• YouTube
• 29 minutes
• On-Demand
• Free Video

Constrained Optimization Over Semirings

Explore complexity of constraint optimization over semirings, focusing on OptConf problem. Discover complexity results for various semirings and potential for SAT solver-based algorithms.

• YouTube
• 29 minutes
• On-Demand
• Free Video

Games of Imperfect Information - Designing Signaling Strategies

Explore strategies for designing signaling in games with asymmetric information, focusing on principal-agent interactions and their applications in real-world scenarios.

• YouTube
• 37 minutes
• On-Demand
• Free Video

Symbolic Finite- and Infinite-state Synthesis

Explore innovative abstraction-refinement techniques for LTL synthesis, enhancing scalability and addressing infinite-state challenges through liveness refinements and symbolic representations.

• YouTube
• 35 minutes
• On-Demand
• Free Video

Attractor Decompositions in Games and Automata

Explore attractor decompositions in graphs, their role in parity games, and applications to automata theory. Learn about structural complexity measures and strategy analysis.

• YouTube
• 37 minutes
• On-Demand
• Free Video

Descriptive Complexity for Distributed Computing and Neural Networks

Explore logics capturing distributed computing and neural network models, including graph neural networks. Dive into game-theoretic semantics and computational logic connections.

• YouTube
• 59 minutes
• On-Demand
• Free Video

Promise Algebra: A Functional Approach to Non-Deterministic Computations

Algebraic approach to modeling non-determinism in computational processes, using promise algebra and history-dependent choice functions to analyze complexity and generate strategies.

• YouTube
• 26 minutes
• On-Demand
• Free Video

Localized Attractor Computations for Infinite-State Games

Explore symbolic methods for solving infinite-state games, focusing on localized attractor computations in sub-games to enhance efficiency and tackle complex problem instances.

• YouTube
• 33 minutes
• On-Demand
• Free Video

Computing a Fixed Point of Contraction Maps in Polynomial Queries

Efficient algorithm for computing fixed points of contraction maps, with potential implications for solving simple stochastic games and related computational problems.

• YouTube
• 37 minutes
• On-Demand
• Free Video

Reaching Collective Decisions in Voting Systems - Game Theory Perspective

Explore game-theoretic analysis of voting scenarios, examining stable outcomes and convergence of iterative processes in collective decision-making for socio-economic and technological systems.

• YouTube
• 1 hour
• On-Demand
• Free Video

Subgame Perfection in Infinite Duration Graph Games

Explore algorithms for manipulating subgame perfect equilibria in infinite duration graph games, with insights on recent developments and applications in system design and analysis.

• YouTube
• 1 hour 3 minutes
• On-Demand
• Free Video

Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries

Explores computing rainbow cycle numbers using SAT modulo Symmetries, enhancing understanding of envy-freeness in fair division of indivisible goods and improving EFX allocation feasibility guarantees.

• YouTube
• 40 minutes
• On-Demand
• Free Video

Controller Synthesis Beyond the Worst Case

Explore automatic control strategy synthesis for challenging environments, connecting decision and game theory to achieve best-effort control under overwhelming disturbances.

• YouTube
• 48 minutes
• On-Demand
• Free Video

Multi-agent Games with Finite-horizon Goals

Explore complexity in multi-agent systems with finite-horizon goals, examining mathematical properties, use cases, and representation challenges in game theory and distributed systems analysis.

• YouTube
• 45 minutes
• On-Demand
• Free Video