Finite Two-Person Zero-Sum Games

Hans Peters

Chapter 2 in Game Theory, 2015, pp 25-35 from Springer

Abstract: Abstract This chapter deals with two-player games in which each player chooses from finitely many pure strategies or randomizes among these strategies, and the sum of the players’ payoffs or expected payoffs is always equal to zero. Games like the Battle of the Bismarck Sea and Matching Pennies, discussed in Sect. 1.3.1 belong to this class.

Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sptchp:978-3-662-46950-7_2

Ordering information: This item can be ordered from
http://www.springer.com/9783662469507

DOI: 10.1007/978-3-662-46950-7_2

Access Statistics for this chapter

More chapters in Springer Texts in Business and Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().