MY-ASSIGNMENTEXPERT™可以为您提供 inf.ed.ac.uk CS4 Game theory博弈论的代写代考和辅导服务！
这是爱丁堡大学博弈论课程的代写成功案例。
CS4课程简介
This is an MSc (and 4th year) course that runs in Semester 2 (Spring 2023). The lecturer is Kousha Etessami. Some of the information below is still from the prior year, 2022. It will be updated during the course. The lecture times for the course are Mondays and Thursdays, 11:10-12:00 (Edinburgh time). The lectures will be recorded and posted online. There will also be weekly toturials, starting in Week 3. These will cover and discuss the contents of the weekly tutorial sheet. There is also a Piazza Discussion Forum for the course, accessible from the LEARN page, where you can post questions and discuss the course content with fellow students (but DO NOT share answers to coursework). The times are indicated under “Timetable” on the AGTA course DPT on the DRPS web pages the tutorial time slots may be subject change at the beginning of the course.
Prerequisites
No required reading.
Reference texts for the entire course see slides of lecture 1 for a more comprehensive list):
M. Maschler, E. Solan, and S. Zamir, Game Theory , Cambridge U. Press, 2013.
(Available online from the University Library.
K. Leyton-Brown and Y. Shoham, “Essentials of Game Theory”, 2008 . A short book, available electronically from the Edinburgh University Library.
N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, Algorithmic Game Theory, Cambridge U. Press, 2007.
Available online from the University library.
Y. Shoham and K. Leyton-Brown, “Multi-agent Systems: algorithmic, game-theoretic, and logical foundations”, 2009. (MAS) A longer book on MAS, also available online. The main focus of the book is game theory.
T. Roughgarden. Twenty Lectures on Algorithmic Game Theory, Cambridge U. Press, 2016.
Available online from the University library.
CS4 Game theory HELP（EXAM HELP， ONLINE TUTOR）
Consider the following simple card game. Player $R$ is given a red 5 and a black 5 , while player $C$ is given a black 5 , a red 3 , and a red 2 . The game they are to play is the following: at a given signal the players simultaneously expose one of their cards. If the cards match in color, player $R$ wins the (positive) difference between the numbers on the cards; if the cards do not match in color, player $C$ wins the (positive) difference between the numbers on the cards played. Construct a payoff matrix for this game.
Consider a game with payoff matrix shown below. Assume that the numbers represent the amount of money player $C$ must pay player $R$ (This means that player $C$ will desire negative payoffs, since then player $R$ must pay him!).
$$
\left[\begin{array}{ccc}
1 & 3 & -2 \
5 & -4 & -1
\end{array}\right]
$$
(a) Use the payoff matrix below to find the most aggressive strategies for each player
(b) Should each player follow their most aggressive strategy? Explain why or why not.
Using the same payoff matrix as in the previous problem,
(a) describe the most conservative strategy each player can choose.
(b) If you were offered the chance to play this game for real money as player $R$, would you play? Why or why not?
(c) Same question as part (b), but now you are offered the role of player $C$ ?
Suppose each of our two players $(R$ and $C$ ) play the following game: Each of the two players shows one or two fingers (simultaneously) and $C$ pays to $R$ a sum equal to the number of fingers shown.
(a) Write the payoff matrix.
(b) Is this game fair? Explain why or why not.
(c) Can you predict the outcome before the game is even played? Explain.
MY-ASSIGNMENTEXPERT™可以为您提供 INF.ED.AC.UK CS4 GAME THEORY博弈论的代写代考和辅导服务！
