Zero-sum games are situations where one side's gain is equal to the other side's loss, resulting in a net benefit of zero. Examples include poker, chess, bridge and futures contracts. Non-zero-sum games can have a net benefit of more or less than zero. The minimax theorem and Nash equilibrium are used to solve zero-sum games, while Prisoner's Dilemma is an example of a non-zero-sum game.

Carnegie Mellon University

Spring 2022

This course explores the design and analysis of algorithms, algorithmic modelling techniques, and their efficiency. It aims to provide tools for designing and analyzing personal algorithms, using various analytical tools and frameworks. Some advanced topics not commonly covered in textbooks are also taught.

No concepts data

+ 37 more conceptsUC Berkeley

Spring 2020

This is an introductory course to computer science theory, exploring the design and analysis of various algorithms, number theory, and complexity. The prerequisites include familiarity with mathematical induction, big-O notation, basic data structures, and programming in a standard language.

No concepts data

+ 36 more concepts