Math 611: Game Theory Notes Chetan Prakash 2012
|
|
- Derek Chambers
- 5 years ago
- Views:
Transcription
1 Math 611: Game Theory Notes Chetan Prakash 2012 Devised in 1944 by von Neumann and Morgenstern, as a theory of economic (and therefore political) interactions. For: Decisions made in conflict situations. Applications to: tactical situations, weapons systems analysis, logistics, economics, sales strategies etc. Game theory is no panacea for existing problems, giving only tentative results. However, it often stimulates deeper analysis, and offers a good language within which to analyze conflict. ASSUMPTIONS 1. There is conflict, focused on some central issue. I.e., there are opposing interests which have the same objective. 2. Participants make simultaneous decisions on their courses of action; these decisions are irrevocable. 3. Neither participant can exert complete control on the game. 4. Each participant is rational and measures the worth of all possible outcomes on the same scale. The latter is often a problem in real-world applications. A more realistic study, building on game theory, is utility theory. CRITERION for OPTIMAL PLAY In general, we prefer conservative as against speculative decisions, because the risk of failure may be unacceptable (e.g., in nuclear war). So we use the WALD CRITERION: Maximize the minimum gain (or minimize the maximum loss). So we wish to make as large as possible the least amount we can expect to win. TERMS Person: one of the opposing players Game: The collection of rules, together with the size of bets or penalties, i.e., the payoffs. These rules are: complete, unchanging, known to all persons. Zero-Sum Game: one in which the total winnings = total losses. Play of a game: A choice of a particular alternative action by each player, and the resulting exchange of payoff. Strategy: A plan of action, complete and ready before the game starts.
2 Optimal Strategy: A strategy guaranteeing the best possible results using the Wald criterion, regardless of the other players moves. Value of the Game: The expected payoff, given that each player plays their own optimal strategy. Solution: A listing of the optimal strategy for each player and a real number for the value of the game. Saddle point for a game: a set of individual alternatives for each player that are together optimal: if any one player deviates from his action, that player will do worse than if all players play the saddle-point alternatives. Most games do not have a saddle-point solution, so some other kind of strategy needs to be devised for them. Two-person, zero-sum games: Two players only, the payoff to one being equal to the loss to the other. We will only consider two-person, zero-sum games in devising solutions below. In such games, we can pictorialize the game by means of a payoff matrix, as below: Red Player s actions Blue 1. Player s 2 P(2,3) actions 3 4 Here, e.g., P(2,3) indicates the payoff blue receives from red, when blue plays his second action and red plays his third. We fill up all the entries of this matrix with such payoffs. Example 2 in the handout: If both bids are equal, we will flip a coin to see who gets the car. In this case, the net payoff is still zero, but in a probabilistic sense of expectation: e.g., if both bid $300, Rogers makes $200 if he gets the car on the coin-flip and loses $200 otherwise. We give the payoff matrix below. We write the actions as bids in multiples of $100. Verify that each entry is correct. On the right we note the worst thing that can happen to Rogers for each of his alternatives, measured over all of Cooper s possible actions. On the bottom we note the same thing for Cooper.
3 Cooper s Actions Row minima Rogers Actions Column maxima Here the game has a saddle-point actually two of them. If Rogers bids $400 or $500, and Cooper bids $400, they will each minimize their maximum loss. In either case, the value of the game is $0, so it is fair to both. What would happen if Roger got greedy and bid, say, $200, in the hope of Cooper s being chintzy and so getting $300-worth off of him? Cooper knows game theory, so even though he really wants to low-bid, rationality wins out and he bids his optimal $400 his entire pot. As a result, and because of Rogers fantasy of riches, he looses $100 to Cooper! That s why the best thing is for both players to be rational and play the optimal strategy. Remember, each player knows the others strategies and the payoff matrix. In general, it is true that the minimax of the payoff matrix (i.e., the least of the column maxima) is at least as large as its maximin (i.e., the largest of the row minima). Can you see why? Another Game with a Saddle Point Blue alternative #3, Red alternative #2, with Value 5. Why?
4 USING DOMINANCE to simplify a game Sometimes we can eliminate a strategy for a player, because there is a different strategy such that, for each of the other player s alternatives, this other strategy is better. For the row player, this translates into a row alternative that has higher numbers, in each entry, across the dominated row. For the column player, this translates into lower numbers. Why? Here is an example: Blue s alternative #1 is at least as good as Blue s alternative #4: 2>1, 3>2, 3 3, 4>1. So we can get rid of the fourth alternative: Now a new dominance emerges (one which wasn t there before (check that!)): Column #1 dominates column #4, because 2<4, 1<3, 1<2. So get rid of column #4: A Game with No Saddle Point We both hold up one or two fingers. If it s the same number, I loose $1 to you. If both are different, I gain $1 from you: Work out the row minima and column maxima and see why there is no saddle-point, i.e., a matrix entry that is both its minimum in its row and its maximum in its column. What do we do in this instance?
5 Von Neuman s and Morgenstern s brilliant solution in this instance was to let each player consider a strategy of mixed alternatives. Each alternative might be played, but in a random manner, dictated by an optimal probability of play. Random strategies may be implemented as follows: Numbers from, say, 0000 to 9999 are broken into groups, the size of each group being in proportion with the probability assigned to each alternative. For example, if x = 2/3, the numbers from 0000 to 6666 are assigned to alternative 1, whilst those from 6667 to 9999 are assigned to alternative 2. In any given play of the game, a random number is generated by each player. Depending on the value of the random number, the corresponding alternative is chosen. There is a theorem that in any zero-sum game, an optimal mixed strategy exists for each player. In the instance where there is a saddle-point, the mixed strategy becomes a pure strategy: the probability of playing the optimal alternative is 1 and that of playing any of the sub-optimal alternatives is 0, for each player. In the current example, let x be the probability with which Blue plays alternative 1. Then 1-x is the probability with which Blue plays alternative 2 (why?). Then by definition of expectation, for the random variable Blue s Gain : Row Expectations: Expected gain to Blue if Red plays alternative 1 = (-1) (x) + (+1) (1-x) = 1-2x Expected gain to Blue if Red plays alternative 2 = (+1) (x) + (-1) (1-x) = 2x-1 Blue wants to determine a value of x such that he maximizes his minimal gain. The two lines y = 1-2x and y = 2x-1 are graphed below, for x between the probability values of 0 and 1. For 0<x< ½, the second line gives a lower expectation.: this is the worst that can happen to Blue. For ½<x<1, the first line is the lower one: this is now the worst that can happen to Blue. The x-value for which these worst possibilities is maximized is clearly where they intersect: at x = ½. At this x, the expected gain is found by simply plugging that number into either of the expressions above (the result will be the same, as the two lines are of the same height at their intersection). Here, the Value of the game is 0.
6 plot 1 K 2 x, 2 x K 1, x = 0..1, y =K y x K0.5 K1 The situation is similar for Red. Let s say that Red plays his strategy 1 with probability z and therefore his alternative 2 with probability 1-z. Then Column Expectations Expected gain to Red if Blue plays alternative 1 = (-1) (z) + (+1) (1-z) = 1-2z Expected gain to Red if Blue plays alternative 2 = (+1) (z) + (-1) (1-z) = 2z-1 Again, if we were to plot the two lines y = 1-2z and y = 2z-1, their intersection would be at z = ½ with a value of 0. We express the solution of the game as follows: Blue s optimal strategy is (½, ½); Red s optimal strategy is (½, ½); Value of the game is 0. This graphical method works for any game in which a player has exactly two alternatives available. Simply replace the payoffs given above by those in the game under consideration, and proceed to compute the intersection values of x and z, and the value of the game (the height of the appropriate straight lines at the optimal point).
Game Theory two-person, zero-sum games
GAME THEORY Game Theory Mathematical theory that deals with the general features of competitive situations. Examples: parlor games, military battles, political campaigns, advertising and marketing campaigns,
More informationLecture Notes on Game Theory (QTM)
Theory of games: Introduction and basic terminology, pure strategy games (including identification of saddle point and value of the game), Principle of dominance, mixed strategy games (only arithmetic
More informationGame Theory. Problem data representing the situation are constant. They do not vary with respect to time or any other basis.
Game Theory For effective decision making. Decision making is classified into 3 categories: o Deterministic Situation: o o Problem data representing the situation are constant. They do not vary with respect
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 information37 Game Theory. Bebe b1 b2 b3. a Abe a a A Two-Person Zero-Sum Game
37 Game Theory Game theory is one of the most interesting topics of discrete mathematics. The principal theorem of game theory is sublime and wonderful. We will merely assume this theorem and use it to
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 informationTopics in Computer Mathematics. two or more players Uncertainty (regarding the other player(s) resources and strategies)
Choosing a strategy Games have the following characteristics: two or more players Uncertainty (regarding the other player(s) resources and strategies) Strategy: a sequence of play(s), usually chosen to
More informationGAME THEORY Day 5. Section 7.4
GAME THEORY Day 5 Section 7.4 Grab one penny. I will walk around and check your HW. Warm Up A school categorizes its students as distinguished, accomplished, proficient, and developing. Data show that
More informationLect 15:Game Theory: the math of competition
Lect 15:Game Theory: the math of competition onflict characterized human history. It arises whenever 2 or more individuals, with different values or goals, compete to try to control the course of events.
More information1 Deterministic Solutions
Matrix Games and Optimization The theory of two-person games is largely the work of John von Neumann, and was developed somewhat later by von Neumann and Morgenstern [3] as a tool for economic analysis.
More informationJapanese. Sail North. Search Search Search Search
COMP9514, 1998 Game Theory Lecture 1 1 Slide 1 Maurice Pagnucco Knowledge Systems Group Department of Articial Intelligence School of Computer Science and Engineering The University of New South Wales
More informationOptimization of Multipurpose Reservoir Operation Using Game Theory
Optimization of Multipurpose Reservoir Operation Using Game Theory Cyril Kariyawasam 1 1 Department of Electrical and Information Engineering University of Ruhuna Hapugala, Galle SRI LANKA E-mail: cyril@eie.ruh.ac.lk
More informationMath 464: Linear Optimization and Game
Math 464: Linear Optimization and Game Haijun Li Department of Mathematics Washington State University Spring 2013 Game Theory Game theory (GT) is a theory of rational behavior of people with nonidentical
More informationMath 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing April 16, 2017 April 16, 2017 1 / 17 Announcements Please bring a blue book for the midterm on Friday. Some students will be taking the exam in Center 201,
More informationSection Notes 6. Game Theory. Applied Math 121. Week of March 22, understand the difference between pure and mixed strategies.
Section Notes 6 Game Theory Applied Math 121 Week of March 22, 2010 Goals for the week be comfortable with the elements of game theory. understand the difference between pure and mixed strategies. be able
More informationfinal examination on May 31 Topics from the latter part of the course (covered in homework assignments 4-7) include:
The final examination on May 31 may test topics from any part of the course, but the emphasis will be on topic after the first three homework assignments, which were covered in the midterm. Topics from
More informationMath 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing May 8, 2017 May 8, 2017 1 / 15 Extensive Form: Overview We have been studying the strategic form of a game: we considered only a player s overall strategy,
More informationResource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Game Theory
Resource Allocation and Decision Analysis (ECON 8) Spring 4 Foundations of Game Theory Reading: Game Theory (ECON 8 Coursepak, Page 95) Definitions and Concepts: Game Theory study of decision making settings
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 informationSummary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility
Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility theorem (consistent decisions under uncertainty should
More informationGame Theory and Randomized Algorithms
Game Theory and Randomized Algorithms Guy Aridor Game theory is a set of tools that allow us to understand how decisionmakers interact with each other. It has practical applications in economics, international
More informationInstability of Scoring Heuristic In games with value exchange, the heuristics are very bumpy Make smoothing assumptions search for "quiesence"
More on games Gaming Complications Instability of Scoring Heuristic In games with value exchange, the heuristics are very bumpy Make smoothing assumptions search for "quiesence" The Horizon Effect No matter
More informationExploitability and Game Theory Optimal Play in Poker
Boletín de Matemáticas 0(0) 1 11 (2018) 1 Exploitability and Game Theory Optimal Play in Poker Jen (Jingyu) Li 1,a Abstract. When first learning to play poker, players are told to avoid betting outside
More information7. Suppose that at each turn a player may select one pile and remove c chips if c =1
Math 5750-1: Game Theory Midterm Exam with solutions Mar 6 2015 You have a choice of any four of the five problems (If you do all 5 each will count 1/5 meaning there is no advantage) This is a closed-book
More informationDistributed Optimization and Games
Distributed Optimization and Games Introduction to Game Theory Giovanni Neglia INRIA EPI Maestro 18 January 2017 What is Game Theory About? Mathematical/Logical analysis of situations of conflict and cooperation
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 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 informationComputing Nash Equilibrium; Maxmin
Computing Nash Equilibrium; Maxmin Lecture 5 Computing Nash Equilibrium; Maxmin Lecture 5, Slide 1 Lecture Overview 1 Recap 2 Computing Mixed Nash Equilibria 3 Fun Game 4 Maxmin and Minmax Computing Nash
More informationDistributed Optimization and Games
Distributed Optimization and Games Introduction to Game Theory Giovanni Neglia INRIA EPI Maestro 18 January 2017 What is Game Theory About? Mathematical/Logical analysis of situations of conflict and cooperation
More information(a) Left Right (b) Left Right. Up Up 5-4. Row Down 0-5 Row Down 1 2. (c) B1 B2 (d) B1 B2 A1 4, 2-5, 6 A1 3, 2 0, 1
Economics 109 Practice Problems 2, Vincent Crawford, Spring 2002 In addition to these problems and those in Practice Problems 1 and the midterm, you may find the problems in Dixit and Skeath, Games of
More informationMulti-player, non-zero-sum games
Multi-player, non-zero-sum games 4,3,2 4,3,2 1,5,2 4,3,2 7,4,1 1,5,2 7,7,1 Utilities are tuples Each player maximizes their own utility at each node Utilities get propagated (backed up) from children to
More informationComputational Aspects of Game Theory Bertinoro Spring School Lecture 2: Examples
Computational Aspects of Game Theory Bertinoro Spring School 2011 Lecturer: Bruno Codenotti Lecture 2: Examples We will present some examples of games with a few players and a few strategies. Each example
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 informationECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly
ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly Relevant readings from the textbook: Mankiw, Ch. 17 Oligopoly Suggested problems from the textbook: Chapter 17 Questions for
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 informationEcon 302: Microeconomics II - Strategic Behavior. Problem Set #5 June13, 2016
Econ 302: Microeconomics II - Strategic Behavior Problem Set #5 June13, 2016 1. T/F/U? Explain and give an example of a game to illustrate your answer. A Nash equilibrium requires that all players are
More informationarxiv: v1 [cs.gt] 23 May 2018
On self-play computation of equilibrium in poker Mikhail Goykhman Racah Institute of Physics, Hebrew University of Jerusalem, Jerusalem, 91904, Israel E-mail: michael.goykhman@mail.huji.ac.il arxiv:1805.09282v1
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 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 informationLecture 10: September 2
SC 63: Games and Information Autumn 24 Lecture : September 2 Instructor: Ankur A. Kulkarni Scribes: Arjun N, Arun, Rakesh, Vishal, Subir Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer:
More informationExercises for Introduction to Game Theory SOLUTIONS
Exercises for Introduction to Game Theory SOLUTIONS Heinrich H. Nax & Bary S. R. Pradelski March 19, 2018 Due: March 26, 2018 1 Cooperative game theory Exercise 1.1 Marginal contributions 1. If the value
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 information4. Games and search. Lecture Artificial Intelligence (4ov / 8op)
4. Games and search 4.1 Search problems State space search find a (shortest) path from the initial state to the goal state. Constraint satisfaction find a value assignment to a set of variables so that
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 informationComputing optimal strategy for finite two-player games. Simon Taylor
Simon Taylor Bachelor of Science in Computer Science with Honours The University of Bath April 2009 This dissertation may be made available for consultation within the University Library and may be photocopied
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 informationDominant and Dominated Strategies
Dominant and Dominated Strategies Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Junel 8th, 2016 C. Hurtado (UIUC - Economics) Game Theory On the
More informationChapter 3 Learning in Two-Player Matrix Games
Chapter 3 Learning in Two-Player Matrix Games 3.1 Matrix Games In this chapter, we will examine the two-player stage game or the matrix game problem. Now, we have two players each learning how to play
More informationGame Theory: introduction and applications to computer networks
Game Theory: introduction and applications to computer networks Lecture 1: introduction Giovanni Neglia INRIA EPI Maestro 30 January 2012 Part of the slides are based on a previous course with D. Figueiredo
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 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 informationGAME THEORY Edition by G. David Garson and Statistical Associates Publishing Page 1
Copyright @c 2012 by G. David Garson and Statistical Associates Publishing Page 1 @c 2012 by G. David Garson and Statistical Associates Publishing. All rights reserved worldwide in all media. No permission
More informationCS188 Spring 2010 Section 3: Game Trees
CS188 Spring 2010 Section 3: Game Trees 1 Warm-Up: Column-Row You have a 3x3 matrix of values like the one below. In a somewhat boring game, player A first selects a row, and then player B selects a column.
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 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 informationSelf-interested agents What is Game Theory? Example Matrix Games. Game Theory Intro. Lecture 3. Game Theory Intro Lecture 3, Slide 1
Game Theory Intro Lecture 3 Game Theory Intro Lecture 3, Slide 1 Lecture Overview 1 Self-interested agents 2 What is Game Theory? 3 Example Matrix Games Game Theory Intro Lecture 3, Slide 2 Self-interested
More information18.S34 (FALL, 2007) PROBLEMS ON PROBABILITY
18.S34 (FALL, 2007) PROBLEMS ON PROBABILITY 1. Three closed boxes lie on a table. One box (you don t know which) contains a $1000 bill. The others are empty. After paying an entry fee, you play the following
More informationGAME THEORY MODULE 4. After completing this supplement, students will be able to: 1. Understand the principles of zero-sum, two-person games.
MODULE 4 GAME THEORY LEARNING OBJECTIVES After completing this supplement, students will be able to: 1. Understand the principles of zero-sum, two-person games. 2. Analyze pure strategy games and use dominance
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 informationGame Theory. Chapter 2 Solution Methods for Matrix Games. Instructor: Chih-Wen Chang. Chih-Wen NCKU. Game Theory, Ch2 1
Game Theory Chapter 2 Solution Methods for Matrix Games Instructor: Chih-Wen Chang Chih-Wen Chang @ NCKU Game Theory, Ch2 1 Contents 2.1 Solution of some special games 2.2 Invertible matrix games 2.3 Symmetric
More information4. Game Theory: Introduction
4. Game Theory: Introduction Laurent Simula ENS de Lyon L. Simula (ENSL) 4. Game Theory: Introduction 1 / 35 Textbook : Prajit K. Dutta, Strategies and Games, Theory and Practice, MIT Press, 1999 L. Simula
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 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 informationIntroduction to Game Theory
Introduction to Game Theory Lecture 2 Lorenzo Rocco Galilean School - Università di Padova March 2017 Rocco (Padova) Game Theory March 2017 1 / 46 Games in Extensive Form The most accurate description
More informationAn extended description of the project:
A brief one paragraph description of your project: - Our project mainly focuses on dividing the indivisible properties. This method is applied in many situation of the real life such as: divorce, inheritance,
More informationOverview GAME THEORY. Basic notions
Overview GAME EORY Game theory explicitly considers interactions between individuals hus it seems like a suitable framework for studying agent interactions his lecture provides an introduction to some
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 information(b) In the position given in the figure below, find a winning move, if any. (b) In the position given in Figure 4.2, find a winning move, if any.
Math 5750-1: Game Theory Midterm Exam Mar. 6, 2015 You have a choice of any four of the five problems. (If you do all 5, each will count 1/5, meaning there is no advantage.) This is a closed-book exam,
More informationCS188 Spring 2010 Section 3: Game Trees
CS188 Spring 2010 Section 3: Game Trees 1 Warm-Up: Column-Row You have a 3x3 matrix of values like the one below. In a somewhat boring game, player A first selects a row, and then player B selects a column.
More informationAdvanced Microeconomics (Economics 104) Spring 2011 Strategic games I
Advanced Microeconomics (Economics 104) Spring 2011 Strategic games I Topics The required readings for this part is O chapter 2 and further readings are OR 2.1-2.3. The prerequisites are the Introduction
More informationWaiting Times. Lesson1. Unit UNIT 7 PATTERNS IN CHANCE
Lesson1 Waiting Times Monopoly is a board game that can be played by several players. Movement around the board is determined by rolling a pair of dice. Winning is based on a combination of chance and
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 informationNORMAL FORM (SIMULTANEOUS MOVE) GAMES
NORMAL FORM (SIMULTANEOUS MOVE) GAMES 1 For These Games Choices are simultaneous made independently and without observing the other players actions Players have complete information, which means they know
More informationDominance and Best Response. player 2
Dominance and Best Response Consider the following game, Figure 6.1(a) from the text. player 2 L R player 1 U 2, 3 5, 0 D 1, 0 4, 3 Suppose you are player 1. The strategy U yields higher payoff than any
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 informationMath 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing May 12, 2017 May 12, 2017 1 / 17 Announcements Midterm 2 is next Friday. Questions like homework questions, plus definitions. A list of definitions will be
More informationCSC304: Algorithmic Game Theory and Mechanism Design Fall 2016
CSC304: Algorithmic Game Theory and Mechanism Design Fall 2016 Allan Borodin (instructor) Tyrone Strangway and Young Wu (TAs) September 14, 2016 1 / 14 Lecture 2 Announcements While we have a choice of
More informationExam 2 Sample Questions. Material for Exam 2 comes from Chapter G.1, G.2, G.3, and 14.1, 14.2
Math 1620 Exam 2 Sample Questions Material for Exam 2 comes from Chapter G.1, G.2, G.3, 3.1-3.7 and 14.1, 14.2 The exam will have 4 sections: Matching, Multiple Choice, Short Answer and one Logic Problem.
More informationStudent Name. Student ID
Final Exam CMPT 882: Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte Student Name Student ID Instructions. This exam is worth 30% of your final mark in this course.
More informationGame Theory. Wolfgang Frimmel. Dominance
Game Theory Wolfgang Frimmel Dominance 1 / 13 Example: Prisoners dilemma Consider the following game in normal-form: There are two players who both have the options cooperate (C) and defect (D) Both players
More informationChapter 2 Basics of Game Theory
Chapter 2 Basics of Game Theory Abstract This chapter provides a brief overview of basic concepts in game theory. These include game formulations and classifications, games in extensive vs. in normal form,
More informationChapter 30: Game Theory
Chapter 30: Game Theory 30.1: Introduction We have now covered the two extremes perfect competition and monopoly/monopsony. In the first of these all agents are so small (or think that they are so small)
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 informationThe first player, Fred, turns on the calculator, presses a digit key and then presses the
1. The number pad of your calculator or your cellphone can be used to play a game between two players. Number pads for telephones are usually opposite way up from those of calculators, but that does not
More informationGame Theory. Share information. Evaluate information (obtained from friends, acquaintances and coworkers) Develop trust. Accept or reject friendship
Æ ÇÌ Ë º ÅÁËÀÊ ÈÊÁÄ ¾ ¾¼½¾ Game Theory A social network is not a static structure the individuals in a social network must constantly interact in order to create social capital that reflects how a group
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 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 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 information1. How many subsets are there for the set of cards in a standard playing card deck? How many subsets are there of size 8?
Math 1711-A Summer 2016 Final Review 1 August 2016 Time Limit: 170 Minutes Name: 1. How many subsets are there for the set of cards in a standard playing card deck? How many subsets are there of size 8?
More informationGame theory attempts to mathematically. capture behavior in strategic situations, or. games, in which an individual s success in
Game Theory Game theory attempts to mathematically capture behavior in strategic situations, or games, in which an individual s success in making choices depends on the choices of others. A game Γ consists
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 informationJunior Circle Meeting 5 Probability. May 2, ii. In an actual experiment, can one get a different number of heads when flipping a coin 100 times?
Junior Circle Meeting 5 Probability May 2, 2010 1. We have a standard coin with one side that we call heads (H) and one side that we call tails (T). a. Let s say that we flip this coin 100 times. i. How
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 informationChapter 2. Weighted Voting Systems. Sections 2 and 3. The Banzhaf Power Index
Chapter 2. Weighted Voting Systems Sections 2 and 3. The Banzhaf Power Index John Banzhaf is an attorney and law professor. In 1965, his analysis of the power in the Nassau County NY Board of Supervisors
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 informationModule 5: Probability and Randomness Practice exercises
Module 5: Probability and Randomness Practice exercises PART 1: Introduction to probability EXAMPLE 1: Classify each of the following statements as an example of exact (theoretical) probability, relative
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 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 informationAdversarial Search and Game- Playing C H A P T E R 6 C M P T : S P R I N G H A S S A N K H O S R A V I
Adversarial Search and Game- Playing C H A P T E R 6 C M P T 3 1 0 : S P R I N G 2 0 1 1 H A S S A N K H O S R A V I Adversarial Search Examine the problems that arise when we try to plan ahead in a world
More informationGame theory. Logic and Decision Making Unit 2
Game theory Logic and Decision Making Unit 2 Introduction Game theory studies decisions in which the outcome depends (at least partly) on what other people do All decision makers are assumed to possess
More information