Course:CPSC312-2017-Coordination Game

From UBC Wiki
Jump to: navigation, search

Coordination Game

Authors: Raghav Thakur, and Matthew Siu

What is the problem?

There are a class of games studied under game theory known as coordination games. These look to understand the choices in a payoff matrix and how to maximize payoff in a situation. For example, two hunters have the option to cooperate to hunt a stag with maximum payoff for both. However, there is a slightly lower payoff option to hunt a hare which doesn't require cooperation. There is a potential conflict in choosing the safe option (decent payoff) over cooperation (large payoff).


Stag Hare
Stag 10,10 0,8
Hare 8,0 7,7

We will create a 2 player game where the payoff matrix changes in each round. Both players are looking to maximize their potential payoff which might incentivize them to not cooperate during certain rounds.

What is the something extra?

What is the in-depth aspect you will do? If the problem is related to some other group's project, tell us how they fit together. If in doubt, include the information.

We are going to be creating a user interface using Haskell Gloss so that two users can compete against each other on the same computer visually using a GUI.

What did we learn from doing this?

(This should be written after you have done the work.) What is the bottom-line? Is logic programming suitable for (part-of) the task? Make sure you include the evidence for your claims. Logic programming and Haskell is very efficient for this project as it allows no mutable code.

Source Code

GitHub