• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Zero-Sum Games and the Minimax Theorem: Classical Strictly-Competitive Theory

Zero-Sum Games and the Minimax Theorem: Classical Strictly-Competitive Theory

Paperback

Series: The Game Theory Library, Book 2

EconomicsGeneral MathematicsWorld War II

Currently unavailable to order

ISBN13: 9798192942680
Publisher: Independently Published
Pages: 142
Weight: 0.44
Height: 0.30 Width: 6.00 Depth: 9.00
Language: English

A rational competitor can guarantee a specific number - not a hope, not a range, an exact number - before a single card is dealt, a single kick is taken, or a single shot is fired. That is the promise of the minimax theorem, and this book teaches you to actually use it.

Zero-Sum Games and the Minimax Theorem is a working manual for the branch of game theory where one side's gain is always the other's exact loss. Inside, you'll learn to solve real payoff matrices by hand: spotting saddle points, eliminating dominated strategies, calculating optimal mixed strategies with a formula you can memorize, and reading the graphical and linear-programming methods that scale the same logic up to problems of any size.

Also from

Geissler, Robert

Also in

Economics