Skip to content
lectern.tv
1/14

Search with Other Agents: Expectimax, Utilities

Pieter AbbeelDistinguishedUC Berkeley

Professor of Electrical Engineering and Computer Sciences

1:25:00·2018·undergraduate level

This lecture introduces the Expectimax algorithm for decision-making in stochastic games, contrasting it with Minimax. It covers modeling probabilities, the role of utility functions in rational agents, and implications for human decision-making.

AI & MLAlgorithms & Data StructuresProbability & Information TheoryGame Theory & Mechanism DesignExpectimax Algorithm

COMPSCI 188, LEC 001 - Fall 2018 COMPSCI 188, LEC 001 - Pieter Abbeel, Daniel Klein Copyright @2018 UC Regents; all rights reserved

Source: Webcast Departmental via YouTubeWatch on YouTube
LecturerAll lecturers →
Pieter AbbeelDistinguished

Professor of EECS & Director of Berkeley Robot Learning Lab, UC Berkeley

Professor of EECS at UC Berkeley and ACM Prize in Computing recipient for deep reinforcement learning and apprenticeship robotics.

1 course · 22 lecturesCanon
Previous · Lecture 6

Search with Other Agents: Minimax

Next · Lecture 8

Markov Decision Processes (MDPs) Part 1/2

Comments

Add a comment...Sign in