Главная
Study mode:
on
1
Intro
2
Real-time decision making examples
3
Algorithms: the basics
4
Shortest paths example
5
Modeling the real-world
6
Graph terminology
7
Graph examples
8
Back to shortest paths
9
Dijkstra shortest path algorithm
10
(Basic) Algorithm Design Techniques
11
Algorithm running time
12
NP-Complete problems
13
Approximation algorithms
14
Traveling Salesman Problem
15
Game theory
16
Example: Inefficiency of equilibria
17
Equilibrium
18
Social Optimum
19
Price of Anarchy
20
Optimal route?
21
What is risk?
22
Risk I: Expected Utility Theory
23
Risk II: Mean-variance framework
24
Risk III: Coherent risk measures
25
Implications of risk attitudes
26
Algorithmic challenges
27
Algorithmic insights
Description:
Explore algorithms, game theory, and risk-averse decision making in this comprehensive lecture from the Real-Time Decision Making Boot Camp. Delve into real-world applications of decision-making processes, starting with an introduction to algorithms and their basics. Learn about graph theory, shortest path problems, and the Dijkstra algorithm. Examine algorithm design techniques, running time analysis, and NP-Complete problems. Discover approximation algorithms and their application to the Traveling Salesman Problem. Investigate game theory concepts, including equilibria, social optimum, and the Price of Anarchy. Gain insights into risk assessment through Expected Utility Theory, mean-variance framework, and coherent risk measures. Understand the implications of risk attitudes and the algorithmic challenges they present. Conclude with valuable algorithmic insights for tackling complex decision-making scenarios.

A Brief Introduction to Algorithms, Game Theory and Risk-Averse Decision Making

Simons Institute
Add to list
0:00 / 0:00