Negotiation in Nonzero Sum Games (UMAP)

A unit that relates finite mathematics through the topic of negotiating in nonzero sum games. The formulation of a nonzero sum game as a matrix of points is stated and examples are given. Techniques are discussed for graphing payoff polygons and finding effective strategies. Solutions to nonzero sum games are found by decomposing them into two zerosum games played against a ficticious (or hidden) player. Solved examples and problems from political science and labor negotiations are used to illustrate the main concepts.

Table of Contents:

1. INTRODUCTION

2. SOME EXAMPLES

3. PAYOFF POLYGONS

4. DECOMPOSITION INTO ZERO SUM GAMES

5. THE 45-DEGREE LINE STRATEGY

6. OTHER APPROACHES

7. MODEL EXAM

8. SOLUTIONS TO EXERCISES

9. SOLUTIONS TO MODEL EXAM