"Students play games while learning the connection between these games and Game Theory in computer science or Rock-Paper-Scissors and Poker what s
|
|
- Dora Hines
- 5 years ago
- Views:
Transcription
1 "Students play games while learning the connection between these games and Game Theory in computer science or Rock-Paper-Scissors and Poker what s the connection to computer science?
2 Game Theory Noam Brown Carnegie Mellon TechNights
3 Prisoner s Dilemma Need 2 volunteers Don t Betray Betray Don t Betray 2, 2 0, 3 Betray 3, 0 1, 1
4 Nash Equilibrium Nash Equilibrium: A set of strategies where no player has incentive to deviate Don t Betray If opponent betrays, 1 > 0 If opponent does not betray, 3 > 2 Betray Don t Betray 2, 2 0, 3 Betray 3, 0 1, 1
5 What are Games? Requirements for a game: At least 2 players Actions available for each player Payoffs to each player for those actions Examples?
6 What is Game Theory? Assumptions in Game Theory: 1) All players want to maximize their utility (candy) 2) All players are rational 3) It is common knowledge that all players are rational
7 Tragedy of the Commons Groups of 5-6 Game 1: To pollute or not pollute? Everyone receives 3 fish Anyone may pollute. If you pollute, you receive +2 fish and everyone else receives -1. Game 2: Same as Game 1, except players first vote on whether polluting is allowed. If all players vote against polluting, it is not allowed
8 Tragedy of the Commons
9 2/3 Average Everyone plays! Everyone writes down a number in [0, 100]. Let X be the average of all guesses Whoever s guess is closest to 2 X wins. 3
10 2/3 Average Analysis Range of guesses is [0,100], so range of winning guesses is [0, ]
11 2/3 Average Analysis Range of guesses is [0,100], so range of winning guesses is [0,66 2 ] 3 Therefore, range of rational guesses is [0,66 2 ], 3 so range of winning guesses is [0,44 4 ] 9
12 2/3 Average Analysis Range of guesses is [0,100], so range of winning guesses is [0,66 2 ] 3 Therefore, range of rational guesses is [0,66 2 ], 3 so range of winning guesses is [0,44 4 ] 9 Therefore The game-theoretic solution is 0
13 Pirate s Treasure Groups of 5-6 Pirates are ordered A, B, C, D, and E. A starts as captain. The captain must divide 20 pieces of treasure among the pirates. Then, all pirates vote on the division (the captain breaks ties) If the vote succeeds, the treasure is divided. Otherwise, the captain is thrown overboard and the next pirate in the order becomes the captain.
14 Pirate s Treasure A B C D E Captain A: Captain B: Captain C: Captain D: Captain E:
15 Pirate s Treasure Backward induction! A B C D E Captain A: Captain B: Captain C: Captain D: Captain E: X X X X 20
16 Pirate s Treasure Backward induction! A B C D E Captain A: Captain B: Captain C: Captain D: X X X 20 0 Captain E: X X X X 20
17 Pirate s Treasure Backward induction! A B C D E Captain A: Captain B: Captain C: X X Captain D: X X X 20 0 Captain E: X X X X 20
18 Pirate s Treasure Backward induction! A B C D E Captain A: Captain B: X Captain C: X X Captain D: X X X 20 0 Captain E: X X X X 20
19 Pirate s Treasure Backward induction! A B C D E Captain A: Captain B: X Captain C: X X Captain D: X X X 20 0 Captain E: X X X X 20
20 Rock, Paper, Scissors Does Rock, Paper, Scissors have a Nash equilibrium? 0,0-1,1 1,-1 1,-1 0,0-1,1-1,1 1,-1 0,0
21 Poker Artificial Intelligence I do research on Poker AI Defending world champion among poker AIs Played against the world s best human poker players in 2015
22 Half-Street Kuhn Poker 3 cards: J, Q, and K. Highest card wins Two players are dealt one of the cards Both players ante 1 chip P1 may bet or check If P1 checks, the higher card wins 1 chip If P1 bets, P2 may call or fold - If P2 folds, P1 wins 1 chip - If P2 calls, the highest card wins 2 chips ±1 P1 P2 1, 1 ±2 21
23 Half-Street Kuhn Poker Strategy P1 should always bet with K P2 should always call with K P2 should never call with J Therefore P1 should never bet with Q! ±1 P1 P2 1, 1 ±2 22
24 Half-Street Kuhn Poker Strategy P1 should always bet with K P2 should always call with K P2 should never call with J Therefore P1 should never bet with Q! Call with Q ±1 P1 P2 1, 1 ±2 Fold with Q Bet with J Check with J 23
25 Half-Street Kuhn Poker Strategy P1 should always bet with K P2 should always call with K P2 should never call with J Therefore P1 should never bet with Q! Optimal strategy: Randomize! P1: Bets with J 33% of the time P2: Call with Q 33% of the time ±1 P1 P2 1, 1 ±2 24
26 Other Topics: Braess Paradox Can building a road increase traffic? Suppose there are 4000 drivers We construct a superfast highway from A to B
27 Other Topics: Elections Are there election systems where everyone wants to vote truthfully?
A Brief Introduction to Game Theory
A Brief Introduction to Game Theory Jesse Crawford Department of Mathematics Tarleton State University April 27, 2011 (Tarleton State University) Brief Intro to Game Theory April 27, 2011 1 / 35 Outline
More informationA Brief Introduction to Game Theory
A Brief Introduction to Game Theory Jesse Crawford Department of Mathematics Tarleton State University November 20, 2014 (Tarleton State University) Brief Intro to Game Theory November 20, 2014 1 / 36
More information2. The Extensive Form of a Game
2. The Extensive Form of a Game In the extensive form, games are sequential, interactive processes which moves from one position to another in response to the wills of the players or the whims of chance.
More informationMultiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence
Multiagent Systems: Intro to Game Theory CS 486/686: Introduction to Artificial Intelligence 1 Introduction So far almost everything we have looked at has been in a single-agent setting Today - Multiagent
More informationMultiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence
Multiagent Systems: Intro to Game Theory CS 486/686: Introduction to Artificial Intelligence 1 Introduction So far almost everything we have looked at has been in a single-agent setting Today - Multiagent
More informationMultiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence
Multiagent Systems: Intro to Game Theory CS 486/686: Introduction to Artificial Intelligence 1 1 Introduction So far almost everything we have looked at has been in a single-agent setting Today - Multiagent
More informationLecture #3: Networks. Kyumars Sheykh Esmaili
Lecture #3: Game Theory and Social Networks Kyumars Sheykh Esmaili Outline Games Modeling Network Traffic Using Game Theory Games Exam or Presentation Game You need to choose between exam or presentation:
More informationSimultaneous-Move Games: Mixed Strategies. Games Of Strategy Chapter 7 Dixit, Skeath, and Reiley
Simultaneous-Move Games: Mixed Strategies Games Of Strategy Chapter 7 Dixit, Skeath, and Reiley Terms to Know Expected Payoff Opponent s Indifference Property Introductory Game The professor will assign
More informationECO 220 Game Theory. Objectives. Agenda. Simultaneous Move Games. Be able to structure a game in normal form Be able to identify a Nash equilibrium
ECO 220 Game Theory Simultaneous Move Games Objectives Be able to structure a game in normal form Be able to identify a Nash equilibrium Agenda Definitions Equilibrium Concepts Dominance Coordination Games
More informationDECISION MAKING GAME THEORY
DECISION MAKING GAME THEORY THE PROBLEM Two suspected felons are caught by the police and interrogated in separate rooms. Three cases were presented to them. THE PROBLEM CASE A: If only one of you confesses,
More informationOptimal Rhode Island Hold em Poker
Optimal Rhode Island Hold em Poker Andrew Gilpin and Tuomas Sandholm Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 {gilpin,sandholm}@cs.cmu.edu Abstract Rhode Island Hold
More informationCSC304 Lecture 2. Game Theory (Basic Concepts) CSC304 - Nisarg Shah 1
CSC304 Lecture 2 Game Theory (Basic Concepts) CSC304 - Nisarg Shah 1 Game Theory How do rational, self-interested agents act? Each agent has a set of possible actions Rules of the game: Rewards for the
More informationCS510 \ Lecture Ariel Stolerman
CS510 \ Lecture04 2012-10-15 1 Ariel Stolerman Administration Assignment 2: just a programming assignment. Midterm: posted by next week (5), will cover: o Lectures o Readings A midterm review sheet will
More informationGrade 7/8 Math Circles. February 14 th /15 th. Game Theory. If they both confess, they will both serve 5 hours of detention.
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles February 14 th /15 th Game Theory Motivating Problem: Roger and Colleen have been
More informationECO 463. SimultaneousGames
ECO 463 SimultaneousGames Provide brief explanations as well as your answers. 1. Two people could benefit by cooperating on a joint project. Each person can either cooperate at a cost of 2 dollars or fink
More informationIntroduction to Game Theory a Discovery Approach. Jennifer Firkins Nordstrom
Introduction to Game Theory a Discovery Approach Jennifer Firkins Nordstrom Contents 1. Preface iv Chapter 1. Introduction to Game Theory 1 1. The Assumptions 1 2. Game Matrices and Payoff Vectors 4 Chapter
More informationCPS 570: Artificial Intelligence Game Theory
CPS 570: Artificial Intelligence Game Theory Instructor: Vincent Conitzer What is game theory? Game theory studies settings where multiple parties (agents) each have different preferences (utility functions),
More informationMicroeconomics of Banking: Lecture 4
Microeconomics of Banking: Lecture 4 Prof. Ronaldo CARPIO Oct. 16, 2015 Administrative Stuff Homework 1 is due today at the end of class. I will upload the solutions and Homework 2 (due in two weeks) later
More informationAdvanced Microeconomics: Game Theory
Advanced Microeconomics: Game Theory P. v. Mouche Wageningen University 2018 Outline 1 Motivation 2 Games in strategic form 3 Games in extensive form What is game theory? Traditional game theory deals
More information1 Game Theory and Strategic Analysis
Page 1 1 Game Theory and Strategic Analysis 11. 12. 13. 14. Static Games and Nash Equilibrium Imperfect Competition Explicit and Implicit Cooperation Strategic Commitment (a) Sequential games and backward
More informationSolution Concepts 4 Nash equilibrium in mixed strategies
Solution Concepts 4 Nash equilibrium in mixed strategies Watson 11, pages 123-128 Bruno Salcedo The Pennsylvania State University Econ 402 Summer 2012 Mixing strategies In a strictly competitive situation
More informationIntroduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2016 Prof. Michael Kearns
Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2016 Prof. Michael Kearns Game Theory for Fun and Profit The Beauty Contest Game Write your name and an integer between 0 and 100 Let
More informationReflections on the First Man vs. Machine No-Limit Texas Hold 'em Competition
Reflections on the First Man vs. Machine No-Limit Texas Hold 'em Competition Sam Ganzfried Assistant Professor, Computer Science, Florida International University, Miami FL PhD, Computer Science Department,
More informationImperfect Information. Lecture 10: Imperfect Information. What is the size of a game with ii? Example Tree
Imperfect Information Lecture 0: Imperfect Information AI For Traditional Games Prof. Nathan Sturtevant Winter 20 So far, all games we ve developed solutions for have perfect information No hidden information
More information1\2 L m R M 2, 2 1, 1 0, 0 B 1, 0 0, 0 1, 1
Chapter 1 Introduction Game Theory is a misnomer for Multiperson Decision Theory. It develops tools, methods, and language that allow a coherent analysis of the decision-making processes when there are
More informationExtensive Games with Perfect Information A Mini Tutorial
Extensive Games withperfect InformationA Mini utorial p. 1/9 Extensive Games with Perfect Information A Mini utorial Krzysztof R. Apt (so not Krzystof and definitely not Krystof) CWI, Amsterdam, the Netherlands,
More information2-Player Zero-Sum games. 2-player general-sum games. In general, game theory is a place where randomized algorithms are crucial
5-859(M) Randomized Algorithms Game Theory Avrim Blum Plan for Today 2-player zero-sum games Minima optimality Minima theorem and connection to regret minimization 2-player general-sum games Nash equilibria
More informationThe extensive form representation of a game
The extensive form representation of a game Nodes, information sets Perfect and imperfect information Addition of random moves of nature (to model uncertainty not related with decisions of other players).
More informationCOORDINATION GAMES. Nash Equilibria, Schelling Points and the Prisoner s Dilemma. Owain Evans, MIT Paradox, Monday 25 February 2013.
COORDINATION GAMES Nash Equilibria, Schelling Points and the Prisoner s Dilemma Owain Evans, MIT Paradox, Monday 25 February 2013. 2 Newcomb s Paradox $1,000? Box A Box B Image by MIT OpenCourseWare. 3
More informationIntroduction to Auction Theory: Or How it Sometimes
Introduction to Auction Theory: Or How it Sometimes Pays to Lose Yichuan Wang March 7, 20 Motivation: Get students to think about counter intuitive results in auctions Supplies: Dice (ideally per student)
More informationCMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro
CMU 15-781 Lecture 22: Game Theory I Teachers: Gianni A. Di Caro GAME THEORY Game theory is the formal study of conflict and cooperation in (rational) multi-agent systems Decision-making where several
More informationGames of Perfect Information and Backward Induction
Games of Perfect Information and Backward Induction Economics 282 - Introduction to Game Theory Shih En Lu Simon Fraser University ECON 282 (SFU) Perfect Info and Backward Induction 1 / 14 Topics 1 Basic
More informationIntroduction to Game Theory
Introduction to Game Theory Managing with Game Theory Hongying FEI Feihy@i.shu.edu.cn Poker Game ( 2 players) Each player is dealt randomly 3 cards Both of them order their cards as they want Cards at
More informationIntroduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2014 Prof. Michael Kearns percent who will actually attend 100% Attendance Dynamics: Concave equilibrium: 100% percent expected to attend
More informationTHEORY: NASH EQUILIBRIUM
THEORY: NASH EQUILIBRIUM 1 The Story Prisoner s Dilemma Two prisoners held in separate rooms. Authorities offer a reduced sentence to each prisoner if he rats out his friend. If a prisoner is ratted out
More informationGame Theory ( nd term) Dr. S. Farshad Fatemi. Graduate School of Management and Economics Sharif University of Technology.
Game Theory 44812 (1393-94 2 nd term) Dr. S. Farshad Fatemi Graduate School of Management and Economics Sharif University of Technology Spring 2015 Dr. S. Farshad Fatemi (GSME) Game Theory Spring 2015
More informationContents. MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes. 1 Wednesday, August Friday, August Monday, August 28 6
MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes Contents 1 Wednesday, August 23 4 2 Friday, August 25 5 3 Monday, August 28 6 4 Wednesday, August 30 8 5 Friday, September 1 9 6 Wednesday, September
More informationGame Theory and the Environment. Game Theory and the Environment
and the Environment Static Games of Complete Information Game theory attempts to mathematically capture behavior in strategic situations Normal Form Game: Each Player simultaneously choose a strategy,
More informationECON 282 Final Practice Problems
ECON 282 Final Practice Problems S. Lu Multiple Choice Questions Note: The presence of these practice questions does not imply that there will be any multiple choice questions on the final exam. 1. How
More informationChapter 15: Game Theory: The Mathematics of Competition Lesson Plan
Chapter 15: Game Theory: The Mathematics of Competition Lesson Plan For All Practical Purposes Two-Person Total-Conflict Games: Pure Strategies Mathematical Literacy in Today s World, 9th ed. Two-Person
More informationSpring 2014 Quiz: 10 points Answer Key 2/19/14 Time Limit: 53 Minutes (FAS students: Teaching Assistant. Total Point Value: 10 points.
Gov 40 Spring 2014 Quiz: 10 points Answer Key 2/19/14 Time Limit: 53 Minutes (FAS students: 11:07-12) Name (Print): Teaching Assistant Total Point Value: 10 points. Your Grade: Please enter all requested
More informationReading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992.
Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992. Additional readings could be assigned from time to time. They are an integral part of the class and you are expected to read
More informationIntroduction: What is Game Theory?
Microeconomics I: Game Theory Introduction: What is Game Theory? (see Osborne, 2009, Sect 1.1) Dr. Michael Trost Department of Applied Microeconomics October 25, 2013 Dr. Michael Trost Microeconomics I:
More informationMixed Strategies; Maxmin
Mixed Strategies; Maxmin CPSC 532A Lecture 4 January 28, 2008 Mixed Strategies; Maxmin CPSC 532A Lecture 4, Slide 1 Lecture Overview 1 Recap 2 Mixed Strategies 3 Fun Game 4 Maxmin and Minmax Mixed Strategies;
More informationGame Theory. (4) What would you choose if your partner chooses Heads? (5) What would you choose if your partner chooses Tails?
Game Theory The UCI Math Circle Penny Game Now you and your partner play the penny game, each of you can choose either heads or tails. You can get one candy from your partner if your choices are the same.
More informationIntroduction to Game Theory
Introduction to Game Theory Review for the Final Exam Dana Nau University of Maryland Nau: Game Theory 1 Basic concepts: 1. Introduction normal form, utilities/payoffs, pure strategies, mixed strategies
More informationAdversarial Search and Game Theory. CS 510 Lecture 5 October 26, 2017
Adversarial Search and Game Theory CS 510 Lecture 5 October 26, 2017 Reminders Proposals due today Midterm next week past midterms online Midterm online BBLearn Available Thurs-Sun, ~2 hours Overview Game
More informationIntroduction to Game Theory I
Nicola Dimitri University of Siena (Italy) Rome March-April 2014 Introduction to Game Theory 1/3 Game Theory (GT) is a tool-box useful to understand how rational people choose in situations of Strategic
More informationIncomplete Information. So far in this course, asymmetric information arises only when players do not observe the action choices of other players.
Incomplete Information We have already discussed extensive-form games with imperfect information, where a player faces an information set containing more than one node. So far in this course, asymmetric
More informationSequential games. We may play the dating game as a sequential game. In this case, one player, say Connie, makes a choice before the other.
Sequential games Sequential games A sequential game is a game where one player chooses his action before the others choose their. We say that a game has perfect information if all players know all moves
More informationLECTURE 26: GAME THEORY 1
15-382 COLLECTIVE INTELLIGENCE S18 LECTURE 26: GAME THEORY 1 INSTRUCTOR: GIANNI A. DI CARO ICE-CREAM WARS http://youtu.be/jilgxenbk_8 2 GAME THEORY Game theory is the formal study of conflict and cooperation
More informationINTRODUCTION TO GAME THEORY
1 / 45 INTRODUCTION TO GAME THEORY Heinrich H. Nax hnax@ethz.ch & Bary S. R. Pradelski bpradelski@ethz.ch February 20, 2017: Lecture 1 2 / 45 A game Rules: 1 Players: All of you: https://scienceexperiment.online/beautygame/vote
More informationGame Theory: The Basics. Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943)
Game Theory: The Basics The following is based on Games of Strategy, Dixit and Skeath, 1999. Topic 8 Game Theory Page 1 Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943)
More informationGames. Episode 6 Part III: Dynamics. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto
Games Episode 6 Part III: Dynamics Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Dynamics Motivation for a new chapter 2 Dynamics Motivation for a new chapter
More informationGame Theory Week 1. Game Theory Course: Jackson, Leyton-Brown & Shoham. Game Theory Course: Jackson, Leyton-Brown & Shoham Game Theory Week 1
Game Theory Week 1 Game Theory Course: Jackson, Leyton-Brown & Shoham A Flipped Classroom Course Before Tuesday class: Watch the week s videos, on Coursera or locally at UBC Hand in the previous week s
More informationDynamic games: Backward induction and subgame perfection
Dynamic games: Backward induction and subgame perfection ectures in Game Theory Fall 04, ecture 3 0.0.04 Daniel Spiro, ECON300/400 ecture 3 Recall the extensive form: It specifies Players: {,..., i,...,
More informationGame Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players).
Game Theory Refresher Muriel Niederle February 3, 2009 1. Definition of a Game We start by rst de ning what a game is. A game consists of: A set of players (here for simplicity only 2 players, all generalized
More informationComp 3211 Final Project - Poker AI
Comp 3211 Final Project - Poker AI Introduction Poker is a game played with a standard 52 card deck, usually with 4 to 8 players per game. During each hand of poker, players are dealt two cards and must
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Algorithmic Game Theory Date: 12/6/18
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Algorithmic Game Theory Date: 12/6/18 24.1 Introduction Today we re going to spend some time discussing game theory and algorithms.
More informationTutorial 1. (ii) There are finite many possible positions. (iii) The players take turns to make moves.
1 Tutorial 1 1. Combinatorial games. Recall that a game is called a combinatorial game if it satisfies the following axioms. (i) There are 2 players. (ii) There are finite many possible positions. (iii)
More informationAnalyzing Games: Mixed Strategies
Analyzing Games: Mixed Strategies CPSC 532A Lecture 5 September 26, 2006 Analyzing Games: Mixed Strategies CPSC 532A Lecture 5, Slide 1 Lecture Overview Recap Mixed Strategies Fun Game Analyzing Games:
More informationModeling Security Decisions as Games
Modeling Security Decisions as Games Chris Kiekintveld University of Texas at El Paso.. and MANY Collaborators Decision Making and Games Research agenda: improve and justify decisions Automated intelligent
More informationMultiple Agents. Why can t we all just get along? (Rodney King)
Multiple Agents Why can t we all just get along? (Rodney King) Nash Equilibriums........................................ 25 Multiple Nash Equilibriums................................. 26 Prisoners Dilemma.......................................
More information1. Introduction to Game Theory
1. Introduction to Game Theory What is game theory? Important branch of applied mathematics / economics Eight game theorists have won the Nobel prize, most notably John Nash (subject of Beautiful mind
More informationCS221 Final Project Report Learn to Play Texas hold em
CS221 Final Project Report Learn to Play Texas hold em Yixin Tang(yixint), Ruoyu Wang(rwang28), Chang Yue(changyue) 1 Introduction Texas hold em, one of the most popular poker games in casinos, is a variation
More informationFinance Solutions to Problem Set #8: Introduction to Game Theory
Finance 30210 Solutions to Problem Set #8: Introduction to Game Theory 1) Consider the following version of the prisoners dilemma game (Player one s payoffs are in bold): Cooperate Cheat Player One Cooperate
More informationAn Introduction to Poker Opponent Modeling
An Introduction to Poker Opponent Modeling Peter Chapman Brielin Brown University of Virginia 1 March 2011 It is not my aim to surprise or shock you-but the simplest way I can summarize is to say that
More informationGames with Sequential Moves. Games Of Strategy Chapter 3 Dixit, Skeath, and Reiley
Games with Sequential Moves Games Of Strategy Chapter 3 Dixit, Skeath, and Reiley Terms to Know Action node Backward induction Branch Decision node Decision tree Equilibrium path of play Extensive form
More informationGame Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness
Game Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness March 1, 2011 Summary: We introduce the notion of a (weakly) dominant strategy: one which is always a best response, no matter what
More informationBackward Induction and Stackelberg Competition
Backward Induction and Stackelberg Competition Economics 302 - Microeconomic Theory II: Strategic Behavior Shih En Lu Simon Fraser University (with thanks to Anke Kessler) ECON 302 (SFU) Backward Induction
More informationGame Theory. Department of Electronics EL-766 Spring Hasan Mahmood
Game Theory Department of Electronics EL-766 Spring 2011 Hasan Mahmood Email: hasannj@yahoo.com Course Information Part I: Introduction to Game Theory Introduction to game theory, games with perfect information,
More informationECO 5341 Strategic Behavior Lecture Notes 3
ECO 5341 Strategic Behavior Lecture Notes 3 Saltuk Ozerturk SMU Spring 2016 (SMU) Lecture Notes 3 Spring 2016 1 / 20 Lecture Outline Review: Dominance and Iterated Elimination of Strictly Dominated Strategies
More informationECO 5341 Signaling Games: Another Example. Saltuk Ozerturk (SMU)
ECO 5341 : Another Example and Perfect Bayesian Equilibrium (PBE) (1,3) (2,4) Right Right (0,0) (1,0) With probability Player 1 is. With probability, Player 1 is. cannot observe P1 s type. However, can
More informationECON 312: Games and Strategy 1. Industrial Organization Games and Strategy
ECON 312: Games and Strategy 1 Industrial Organization Games and Strategy A Game is a stylized model that depicts situation of strategic behavior, where the payoff for one agent depends on its own actions
More informationUsing Fictitious Play to Find Pseudo-Optimal Solutions for Full-Scale Poker
Using Fictitious Play to Find Pseudo-Optimal Solutions for Full-Scale Poker William Dudziak Department of Computer Science, University of Akron Akron, Ohio 44325-4003 Abstract A pseudo-optimal solution
More informationDomination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown
Game Theory Week 3 Kevin Leyton-Brown Game Theory Week 3 Kevin Leyton-Brown, Slide 1 Lecture Overview 1 Domination 2 Rationalizability 3 Correlated Equilibrium 4 Computing CE 5 Computational problems in
More informationWhat is Trust and How Can My Robot Get Some? AIs as Members of Society
What is Trust and How Can My Robot Get Some? Benjamin Kuipers Computer Science & Engineering University of Michigan AIs as Members of Society We are likely to have more AIs (including robots) acting as
More informationPerfect Bayesian Equilibrium
Perfect Bayesian Equilibrium When players move sequentially and have private information, some of the Bayesian Nash equilibria may involve strategies that are not sequentially rational. The problem is
More informationUC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Game Theory I (PR 5) The main ideas
UC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Game Theory I (PR 5) The main ideas Lectures 5-6 Aug. 29, 2009 Prologue Game theory is about what happens when
More informationWhat is... Game Theory? By Megan Fava
ABSTRACT What is... Game Theory? By Megan Fava Game theory is a branch of mathematics used primarily in economics, political science, and psychology. This talk will define what a game is and discuss a
More informationNash Equilibrium. Felix Munoz-Garcia School of Economic Sciences Washington State University. EconS 503
Nash Equilibrium Felix Munoz-Garcia School of Economic Sciences Washington State University EconS 503 est Response Given the previous three problems when we apply dominated strategies, let s examine another
More informationPROBLEM SET Explain the difference between mutual knowledge and common knowledge.
PROBLEM SET 1 1. Define Pareto Optimality. 2. Explain the difference between mutual knowledge and common knowledge. 3. Define strategy. Why is it possible for a player in a sequential game to have more
More informationLecture 6: Basics of Game Theory
0368.4170: Cryptography and Game Theory Ran Canetti and Alon Rosen Lecture 6: Basics of Game Theory 25 November 2009 Fall 2009 Scribes: D. Teshler Lecture Overview 1. What is a Game? 2. Solution Concepts:
More informationWeeks 3-4: Intro to Game Theory
Prof. Bryan Caplan bcaplan@gmu.edu http://www.bcaplan.com Econ 82 Weeks 3-4: Intro to Game Theory I. The Hard Case: When Strategy Matters A. You can go surprisingly far with general equilibrium theory,
More information1. Simultaneous games All players move at same time. Represent with a game table. We ll stick to 2 players, generally A and B or Row and Col.
I. Game Theory: Basic Concepts 1. Simultaneous games All players move at same time. Represent with a game table. We ll stick to 2 players, generally A and B or Row and Col. Representation of utilities/preferences
More informationGame Theory. Vincent Kubala
Game Theory Vincent Kubala Goals Define game Link games to AI Introduce basic terminology of game theory Overall: give you a new way to think about some problems What Is Game Theory? Field of work involving
More informationGame Tree Search. CSC384: Introduction to Artificial Intelligence. Generalizing Search Problem. General Games. What makes something a game?
CSC384: Introduction to Artificial Intelligence Generalizing Search Problem Game Tree Search Chapter 5.1, 5.2, 5.3, 5.6 cover some of the material we cover here. Section 5.6 has an interesting overview
More informationIntroduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Algorithms and Game Theory Date: 12/4/14
600.363 Introduction to Algorithms / 600.463 Algorithms I Lecturer: Michael Dinitz Topic: Algorithms and Game Theory Date: 12/4/14 25.1 Introduction Today we re going to spend some time discussing game
More informationThe Game Theory of Game Theory Ruben R. Puentedura, Ph.D.
The Game Theory of Game Theory Ruben R. Puentedura, Ph.D. Why Study Game Theory For Game Creation? Three key applications: For general game design; For social sciences-specific game design; For understanding
More information14.12 Game Theory Lecture Notes Lectures 10-11
4.2 Game Theory Lecture Notes Lectures 0- Muhamet Yildiz Repeated Games In these notes, we ll discuss the repeated games, the games where a particular smaller game is repeated; the small game is called
More informationGame Theory. Vincent Kubala
Game Theory Vincent Kubala vkubala@cs.brown.edu Goals efine game Link games to AI Introduce basic terminology of game theory Overall: give you a new way to think about some problems What Is Game Theory?
More informationIntroduction to Game Theory
Introduction to Game Theory (From a CS Point of View) Olivier Serre Serre@irif.fr IRIF (CNRS & Université Paris Diderot Paris 7) 14th of September 2017 Master Parisien de Recherche en Informatique Who
More informationPrisoner 2 Confess Remain Silent Confess (-5, -5) (0, -20) Remain Silent (-20, 0) (-1, -1)
Session 14 Two-person non-zero-sum games of perfect information The analysis of zero-sum games is relatively straightforward because for a player to maximize its utility is equivalent to minimizing the
More informationFIRST PART: (Nash) Equilibria
FIRST PART: (Nash) Equilibria (Some) Types of games Cooperative/Non-cooperative Symmetric/Asymmetric (for 2-player games) Zero sum/non-zero sum Simultaneous/Sequential Perfect information/imperfect information
More informationChapter 13. Game Theory
Chapter 13 Game Theory A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes. You can t outrun a bear, scoffs the camper. His friend coolly replies, I don
More informationUPenn NETS 412: Algorithmic Game Theory Game Theory Practice. Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5
Problem 1 UPenn NETS 412: Algorithmic Game Theory Game Theory Practice Bonnie Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5 This game is called Prisoner s Dilemma. Bonnie and Clyde have been
More informationECON 301: Game Theory 1. Intermediate Microeconomics II, ECON 301. Game Theory: An Introduction & Some Applications
ECON 301: Game Theory 1 Intermediate Microeconomics II, ECON 301 Game Theory: An Introduction & Some Applications You have been introduced briefly regarding how firms within an Oligopoly interacts strategically
More informationNash Equilibrium. An obvious way to play? Player 1. Player 2. Player 2
Nash Equilibrium An obvious way to play? In Joseph Heller s novel Catch 22, allied victory in WW2 is a foregone conclusion. Yossarian does not want to be one of the last ones to die. His commanding officer
More informationAfter receiving his initial two cards, the player has four standard options: he can "Hit," "Stand," "Double Down," or "Split a pair.
Black Jack Game Starting Every player has to play independently against the dealer. The round starts by receiving two cards from the dealer. You have to evaluate your hand and place a bet in the betting
More informationGame Theory Lecturer: Ji Liu Thanks for Jerry Zhu's slides
Game Theory ecturer: Ji iu Thanks for Jerry Zhu's slides [based on slides from Andrew Moore http://www.cs.cmu.edu/~awm/tutorials] slide 1 Overview Matrix normal form Chance games Games with hidden information
More information