i/io as compared to 4/10 for players 2 and 3. A "correct" way to play Certainly many interesting games are not solvable by this definition.


 Clifford Farmer
 1 years ago
 Views:
Transcription
1 496 MATHEMATICS: D. GALE PROC. N. A. S. A THEORY OF NPERSON GAMES WITH PERFECT INFORMA TION* By DAVID GALE BROWN UNIVBRSITY Communicated by J. von Neumann, April 17, Introduction.The theory of the general nperson game, in contrast to that of the zerosum twoperson game, remains in an unsettled state. The chief problem seems to be that of determining the proper definition of a solution for such games. The efforts in this direction divide themselves into two groups, the cooperative theory in which the players are expected to form coalitions, and the noncooperative in which such coalitions are forbidden. The first group includes the theory of von Neumann and Morgenstern' and the more recent work of Shapley,2 the second the equilibrium point theory of Nash.3 The cooperative theories have the shortcoming that the notion of solution does not give much insight into how the games should be played. The noncooperative theory is more specific in this regard, but unfortunately the definition of solution only applies to particular games and as yet no way has been found to determine a prwri whether a given game is solvable in the noncooperative sense. Certainly many interesting games are not solvable by this definition. The theory to be outlined below gives a very specific notion of solution for a special but important class of nperson games, namely, those with perfect information. The theory is noncooperative in the sense described above. The most general theorem in the literature concerning such games is due to Kuhn4 and states that all such games possess an equilibrium point among their pure strategies. This equilibrium point will not in general be unique, nor will such games be solvable in the sense of Nash. We therefore approach the problem from a different point of view. Our definition of solution leads to a particular set of strategies which form an equilibrium point, but these will generally be mixed rather than pure strategies. 2. Some Examples.An example wifl be useful in motivating the subsequent definitions.5 An integer between 1 and 9 is to be chosen at random by an umpire. Three players are to choose in turn distinct numbers from this range, and the person guessing closest to the chosen number receives one dollar. In case of a tie each player wins a half dollar. A very naive first player might guess 5 initially. A little further thought reveals, however, that the second and third players would be expected to choose numbers 4 and 6 so that the first player's expectation would be i/io as compared to 4/10 for players 2 and 3. A "correct" way to play the game would be for player I to choose either 3 or 7, player II, 7 or 3,
2 VOL. 39, 1953 MATHEMATICS: D. GALE 497 and player III any remaining number. A rough justification for these choices is the following. If players I and II have already chosen, the choice for player III is clear, he will choose the number which maximizes his expectation. If there are several numbers which do this, we assume he is equally likely to pick any one of them. This amounts to the assumption that player III is only interested in maximizing his own expectation and is not concerned at all with the expectations of the others. Now assume player I has chosen. Player II tentatively considers each possible choice under the assumption that player III on the next move will play in accordance with the principles already described. He makes that choice which leaves him with the largest expectation under these assumptions. Now consider the initial choice for player I. For each possible choice he can compute how players II and III will choose in accordance with the principles described above. Thus, in each case he computes his expectation and plays so as to maximize it. Again, if there are several choices which maximize, he chooses among tbem by a random device. The expectations for players I, II, and III if they play as described will be 7/18, 7/18, and 4/18. The theory to be outlined here makes precise the notions described above for any game with perfect information and provides a definition of values and optimal strategies for such games. The reader may wish to amuse himself by solving in the sense of the above example the following continuous version. Three players choose in turn a real number on the unit interval. A player is said to "control" the number t e [0, 1] if t is closer to his choice than to that of the other players. At the end of the game each player is paid an amount equal to the length of the interval he controls. 3. Definitions and Notation.We shall consider here only finite games, and for the sake of clarity and keeping notation under control, we shall assume that the games involved do not have chance moves although all our results carry over to this case. The notations used here are essentially those introduced in an earlier paper.6 We summarize them briefly. Definition: An nperson game r with perfect information consists of: (1) A set X called the set of positions of r. (2) A point xo e X called the initial position. (3) A function d' called the predecessor function which maps X xo into X and has the property: (A) There is an integer N such that GN(X) = XO. (Intuitively, the positions which can be reached on the next move from positions x are the positions 6'1(x).) The set of positions x such that P1(x) = 0 is called the set offinal positions and is denoted by XFp (4) A partition of X  XF into sets (X1, X2... X.). (The position x e Xi if the ith player is to move at position x.)
3 498 MA THEMA TICS: D. GALE PROC. N. A. S. (5) n real valued functions Pi, P2,..., Pn defined on the set XF. P1 is called the ith player's payofffunction. The above five objects constitute the game r. It remains to describe how the game is to be played. The int!uitive notion is the following: Suppose xo e Xi. Then player i chooses a position, xi e G 1(xo). Now suppose xi e Xi. Then player i1 chooses a position. x2 e 6P1(xi), etc. Play continues in this way until a position x e Xp has been chosen, which will always occur because of property (A). At this point the play has terminated and player i receives the amount P&(x), i = 1,... n. As is customary in game theory (but not in practice!), we assume that each player has chosen his "strategy" in advance, that is, he has made up his mind as to what choice he will make at all conceivable positions. The following definitions make these notions precise. Definitions: A play of r is a sequence (xo, xl, x2,..., k) where (P(xi) = xi1, and Xk E XF. A pure strategy at for player i is a function from Xi into X such that for each x e Xi, 0rj(x) e 6(1(x). Given an ntuple of pure strategies (0fi, a2,..., an) we define inductively a play (xo, xi,..., Xk) as follows: xois the initial position. Suppose x1 has been defined and xj e Xi. Then xj+l = o(xj). It follows from the properties of the ao that the sequence so defined is a play, which we call the play determined by (01, o2,..., a) and denote by the symbol <al, 02,..., an>. Finally, if xk is the final position of the play <0r, a2, (Tn>2 we define < 1, 02,... I (n>i = PE(xk)i = 1, 2,..., n. Thus, <(i, a2a..., or.> is the payoff to player i if the strategies (01, a2,..., a,) are chosen by the nplayers. (There is a standard geometric picture of r. The positions are represented by points in a plane. If x = 6P(x') a directed line segment is drawn from x to x'. One can arrange the points x so that these lines do not intersect, thus the figure becomes a topological tree in the plane, and each play is represented by a path of segments running from the initial position xo to some final position. Because of its intuitive appeal, some authors have used the topological tree as a primitive concept in defining a game. From the mathematical point of view there seems little purpose in introducing these geometric irrelevancies into the theory. Further, the predecessor function seems easier to work with. The tree picture may nevertheless be useful in helping one to visualize many of the properties of games.) For the work that follows it is convenient to make a small modification of the concept of pure strategy. In general each time a player makes a move he precludes the possibility of certain positions occurring. It would clearly be a waste of time for him to plan his strategy for positions which he knows cannot occur. Following Kuhn we call the position x irrelevant
4 VOL. 39, 1953 MA THEMA TICS: D. GALE 499 for the strategy atif x belongs to no play <or, 02,..., a,..., an>. Otherwise x is called relevant, and a subset X' c X is called relevant for as if all its positions are relevant. Our modification consists in requiring that each strategy as be defined only on a maximal relevant subset of Xi, relative to as. This condition effects a reduction in the number of pure strategies. Finally we recall the definition of an nperson game in normal form. Such a game consists of n. sets E1, Z2,... Zn whose elements are called strategies, and n real valued functions P1, P2,..., Pn whose domain is the set E1X 2... X ESn If in our game r we let E denote the set of pure strategies for player i, and define Pi(oly f02,..., = < 1, *2, 0.*, > f we see that we have defined a game in normal form corresponding to r which we shall call the normal form of r. 4. The Theory.In this section we shall define a new notion of solution of a game. Games im general will not possess solutions in our sense. However, our fundamental existence theorem states that games with perfect information always have such solutions. Our definition of solution will determine a unique optimal strategy for each player and a set of values or expectations for each player provided all play optimally. A further preliminary remark is of interest. In examining the reasoning used to justify our solution of the example of section 2, it appears that essential use has been made of the extensive form of the game involved. In particular the order in which the players moved played a central role in the argument. It is somewhat surprising, then, that the same solution could have been obtained by examining only the normal form of the game. Indeed we shall define our notion of solution from the normal form alone. Thus, vastly different games will have the same solutions provided they have the same normal form. Definition: The pure strategy a1 dominates a', written 0j> 0l', provided (i) <(1, 2,...2, an>i > <0f1', 2,.,*.>1 for all (02,.* * * 9s) (ii) <01, 02,..(. nn>1 > <a0', 02,..., 0n>1 for some (a2, 0*n).  The pure strategies 01 and 0a' are equivalent if <(Ti, 02, * * *, f>i = <0t1', 02,   , 0On>I for all (q2, g**n). Similar definitions are made for strategies a1, i = 2... n. Our concept of a solution is based on the following two assumptions: (I) A player will not use a dominated strategy. (II) A player will use equivalent strategies with equal probability. A word concerning these assumptions. The notion of dominance has occurred frequently in the study of games, although the usual definition is not precisely the one given here. The second assumption asserts the
5 500 MATHEMATICS: D. GALE PROC. N. A. S. indifference of each player concerning the fate of the others. It might be argued that this condition is unnatural or too restrictive. For example in a twoperson game a player might decide, other things being equal, to do the most possible damage to his opponent, or, if he were more amiable, to help his opponent. Actually we could develop the theory equally well by replacing assumption (II) by various other assumptions. The only requirement is that we shall have some definite rule which will determine the behavior of each player when he is confronted with equivalent strategies, that is, a rule which makes correspond to any set of equivalent pure strategies a probability combination of these strategies. Our indifference assumption, (HI), is the simplest such rule, but others would serve equally well. Corresponding to assumptions (I) and (II) we now introduce two operations on the normal form of r. Operation D1: Deleting all dominated strategies. Operation A1: Replacing all maximal sets of equivalent strategies by a single mixed strategy using each equivalent pure strategy with equal probability (A  averaging). It will be observed that these two operations, when possible, have the effect of reducing the number of strategies for each player. We now define a new game rl itr normal form whose pure strategies are those obtained frdm the original sets by operations D1 and A1.' The payoff functions Pi' are the original payoff functions Pi extended in the usual way to mixed strategies whenever necessary. We now define operations D2 and A2 to. be similar to D1 and A1 but operating on the game rp. We thus obtain a game r2. Since the original number of pure strategies was finite, it is clear that eventually this process must terminate, i.e., no further reduction will be possible. FUNDAMENTAL THEOREM. If r is the normal form of a game uith perfect information, the successive applications of the operations Di and A1 will after a finite number of stages reduce r to a game rk having exactly one pure strategy for each player. It is now clear how to define the solution of r. Since a pure strategy for rk1s a strategy (in general, mixed) for r, we define these unique strategies as the optimal strategies for r and the values are, of course, the respective payoffs to each player when these strategies are used. The proof of the fundamental theorem is quite involved due to the rather complicated structure of games in extensive form. The usual technique of performing an induction on the length of the game does not seem to work here. The proof proceeds by showing that at any stage of the reducing process, if any player has more than one strategy left, then further reductions are possible. As remarked earlier, the optimal mixed strategies form an equilibrium
6 VOL. 39, 1953 MA THEMA TICS: V. HLA VA T Y 501 point. This shows then that if r is twoperson zerosum, our definition of value agrees with the usual one and our optimal strategies are optimal in the accepted sense. The reason we obtain a unique optimal strategy is of course due to the averaging process. This is rather unnatural in some cases; for instance, if a player knew several optimal strategies for chess he would probably use the one which would terminate the game most rapidly. Introducing such considerations would, however, complicate the theory beyond reason. * Written under contract with the National Science Foundation. Neumann, J. von, and Morgenstern, O., The Theory of Games and Economic Behavior. Princeton University Press, Shapley, L. S., "A Value for nperson Games," Contributions to the Theory of GamesII, Annals of Mathematics, Study No. 28, Princeton University Press, Nash, J. F., "Noncooperative Games," Ann. Math., 54, (1951). 4 Kuhn, H. W., "Extensive Games," PROC. NATL. Ac4D. Sci., 36, (1950). 6 Examples of this type were brought to my attention by Mr. J. D. Ellinwood of Brown University, and it was from consideration of these examples that I was led to the investigations reported on herein. 6 Gale, David, and Stewart, F. M., "Infinite Games with Perfect Information," Contributions to the Theory of GamesII, Annals of Mathematics, Study No. 28, Princeton University Press, THE SPINOR CONNECTION IN THE UNIFIED EINSTEIN THEORY OF RELATIVITY BY VACLAV HLAVAT'Y GRADUATE INSTITUTE FOR APPLIED MATHEMATICS, INDIANA UNIVERSITY, BLOOMINGTON, INDIANA* Communicated by T. Y. Thomas, March 26, Introduction.The Einstein unified theory of relativity is based' on a real tensor gx,, which is neither symmetric nor skewsymmetric. We denote its symmetric (skewsymmetric) part by hx,,,(k),,),2 assume that h,;, is of the signature and regard it as the metric tensor of the space X4 of the unified theory of relativity. Moreover, we denote by g, h, k the determinants of gx,,, h),,, and kx,,, respectively, and assume throughout this paper gh 5 0. The structure of g),,, depends on k as well as on D hka"ka)  4hk.
1 Representation of Games. Kerschbamer: Commitment and Information in Games
1 epresentation of Games Kerschbamer: Commitment and Information in Games GameTheoretic Description of Interactive Decision Situations This lecture deals with the process of translating an informal description
More informationSequential lmove Games. Using Backward Induction (Rollback) to Find Equilibrium
Sequential lmove Games Using Backward Induction (Rollback) to Find Equilibrium Sequential Move Class Game: Century Mark Played by fixed pairs of players taking turns. At each turn, each player chooses
More informationAbout the inverse football pool problem for 9 games 1
Seventh International Workshop on Optimal Codes and Related Topics September 61, 013, Albena, Bulgaria pp. 15133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute
More informationSets and Cardinality Notes for C. F. Miller
Sets and Cardinality Notes for 620111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use
More informationInfinitely Repeated Games with Discounting Ù
Infinitely Repeated Games with Discounting Page 1 Infinitely Repeated Games with Discounting Ù Introduction 1 Discounting the future 2 Interpreting the discount factor 3 The average discounted payoff 4
More informationEach copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.
An Approach to Communication Equilibria Author(s): Francoise Forges Source: Econometrica, Vol. 54, No. 6 (Nov., 1986), pp. 13751385 Published by: The Econometric Society Stable URL: http://www.jstor.org/stable/1914304
More informationIn mathematics you don t understand things. You just get used to them. (Attributed to John von Neumann)
Chapter 1 Sets and Functions We understand a set to be any collection M of certain distinct objects of our thought or intuition (called the elements of M) into a whole. (Georg Cantor, 1895) In mathematics
More informationThis chapter is all about cardinality of sets. At first this looks like a
CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },
More informationSYMMETRIC FORM OF THE VON NEUMANN POKER MODEL. Guido David 1, Pearl Anne Po 2
International Journal of Pure and Applied Mathematics Volume 99 No. 2 2015, 145151 ISSN: 13118080 (printed version); ISSN: 13143395 (online version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v99i2.2
More informationCARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE
CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify
More informationTHE TURING DEGREES AND THEIR LACK OF LINEAR ORDER
THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER JASPER DEANTONIO Abstract. This paper is a study of the Turing Degrees, which are levels of incomputability naturally arising from sets of natural numbers.
More information6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games
6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games Asu Ozdaglar MIT February 4, 2009 1 Introduction Outline Decisions, utility maximization Strategic form games Best responses
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationTaylor Polynomials and Taylor Series Math 126
Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will
More informationHackingproofness and Stability in a Model of Information Security Networks
Hackingproofness and Stability in a Model of Information Security Networks Sunghoon Hong Preliminary draft, not for citation. March 1, 2008 Abstract We introduce a model of information security networks.
More informationChapter 7. Sealedbid Auctions
Chapter 7 Sealedbid Auctions An auction is a procedure used for selling and buying items by offering them up for bid. Auctions are often used to sell objects that have a variable price (for example oil)
More informationRegular Languages and Finite Automata
Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a
More informationarxiv:1112.0829v1 [math.pr] 5 Dec 2011
How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly
More informationOn Nashsolvability of chesslike games
R u t c o r Research R e p o r t On Nashsolvability of chesslike games Endre Boros a Vladimir Oudalov c Vladimir Gurvich b Robert Rand d RRR 92014, December 2014 RUTCOR Rutgers Center for Operations
More informationECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2015
ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2015 These notes have been used before. If you can still spot any errors or have any suggestions for improvement, please let me know. 1
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationALMOST COMMON PRIORS 1. INTRODUCTION
ALMOST COMMON PRIORS ZIV HELLMAN ABSTRACT. What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type
More informationGame Theory in Wireless Networks: A Tutorial
1 Game heory in Wireless Networks: A utorial Mark Felegyhazi, JeanPierre Hubaux EPFL Switzerland email: {mark.felegyhazi, jeanpierre.hubaux}@epfl.ch EPFL echnical report: LCAREPOR2006002, submitted
More informationGambling Systems and MultiplicationInvariant Measures
Gambling Systems and MultiplicationInvariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationWorking Paper Series ISSN 14240459. Working Paper No. 238. Stability for Coalition Formation Games. Salvador Barberà and Anke Gerber
Institute for Empirical Research in Economics University of Zurich Working Paper Series ISSN 14240459 Working Paper No. 238 A Note on the Impossibility of a Satisfactory Concept of Stability for Coalition
More informationNotes: Chapter 2 Section 2.2: Proof by Induction
Notes: Chapter 2 Section 2.2: Proof by Induction Basic Induction. To prove: n, a W, n a, S n. (1) Prove the base case  S a. (2) Let k a and prove that S k S k+1 Example 1. n N, n i = n(n+1) 2. Example
More informationDynamics and Equilibria
Dynamics and Equilibria Sergiu Hart Presidential Address, GAMES 2008 (July 2008) Revised and Expanded (November 2009) Revised (2010, 2011, 2012, 2013) SERGIU HART c 2008 p. 1 DYNAMICS AND EQUILIBRIA Sergiu
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationOPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem")
OPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem") BY Y. S. CHOW, S. MORIGUTI, H. ROBBINS AND S. M. SAMUELS ABSTRACT n rankable persons appear sequentially in random order. At the ith
More informationCOUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS
COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics
More informationGame Theory and Poker
Game Theory and Poker Jason Swanson April, 2005 Abstract An extremely simplified version of poker is completely solved from a game theoretic standpoint. The actual properties of the optimal solution are
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationMathematical induction. Niloufar Shafiei
Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of
More informationFinitely Additive Dynamic Programming and Stochastic Games. Bill Sudderth University of Minnesota
Finitely Additive Dynamic Programming and Stochastic Games Bill Sudderth University of Minnesota 1 Discounted Dynamic Programming Five ingredients: S, A, r, q, β. S  state space A  set of actions q(
More informationPsychological Pricing in Mergers & Acquisitions using Game Theory
19th International Congress on Modelling and Simulation, Perth, Australia, 12 16 December 2011 http://mssanz.org.au/modsim2011 Psychological Pricing in Mergers & Acquisitions using Game Theory N. Agarwal
More information6.042/18.062J Mathematics for Computer Science. Expected Value I
6.42/8.62J Mathematics for Computer Science Srini Devadas and Eric Lehman May 3, 25 Lecture otes Expected Value I The expectation or expected value of a random variable is a single number that tells you
More informationMicroeconomic Theory Jamison / Kohlberg / Avery Problem Set 4 Solutions Spring 2012. (a) LEFT CENTER RIGHT TOP 8, 5 0, 0 6, 3 BOTTOM 0, 0 7, 6 6, 3
Microeconomic Theory Jamison / Kohlberg / Avery Problem Set 4 Solutions Spring 2012 1. Subgame Perfect Equilibrium and Dominance (a) LEFT CENTER RIGHT TOP 8, 5 0, 0 6, 3 BOTTOM 0, 0 7, 6 6, 3 Highlighting
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More informationGame Theory and Algorithms Lecture 10: Extensive Games: Critiques and Extensions
Game Theory and Algorithms Lecture 0: Extensive Games: Critiques and Extensions March 3, 0 Summary: We discuss a game called the centipede game, a simple extensive game where the prediction made by backwards
More informationLOOKING FOR A GOOD TIME TO BET
LOOKING FOR A GOOD TIME TO BET LAURENT SERLET Abstract. Suppose that the cards of a well shuffled deck of cards are turned up one after another. At any timebut once only you may bet that the next card
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by MenGen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationNash Equilibria and. Related Observations in OneStage Poker
Nash Equilibria and Related Observations in OneStage Poker Zach Puller MMSS Thesis Advisor: Todd Sarver Northwestern University June 4, 2013 Contents 1 Abstract 2 2 Acknowledgements 3 3 Literature Review
More informationCURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXXI, 1 (2012), pp. 71 77 71 CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC E. BALLICO Abstract. Here we study (in positive characteristic) integral curves
More informationWorking Paper Series
RGEA Universidade de Vigo http://webs.uvigo.es/rgea Working Paper Series A Market Game Approach to Differential Information Economies Guadalupe Fugarolas, Carlos HervésBeloso, Emma Moreno García and
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationAN ANALYSIS OF A WARLIKE CARD GAME. Introduction
AN ANALYSIS OF A WARLIKE CARD GAME BORIS ALEXEEV AND JACOB TSIMERMAN Abstract. In his book Mathematical MindBenders, Peter Winkler poses the following open problem, originally due to the first author:
More informationGAME THEORY. Part II. TwoPerson ZeroSum Games. Thomas S. Ferguson
GAME THEORY Thomas S. Ferguson Part II. TwoPerson ZeroSum Games 1. The Strategic Form of a Game. 1.1 Strategic Form. 1.2 Example: Odd or Even. 1.3 Pure Strategies and Mixed Strategies. 1.4 The Minimax
More informationMathematics for Computer Science
Mathematics for Computer Science Lecture 2: Functions and equinumerous sets Areces, Blackburn and Figueira TALARIS team INRIA Nancy Grand Est Contact: patrick.blackburn@loria.fr Course website: http://www.loria.fr/~blackbur/courses/math
More informationWEAK DOMINANCE: A MYSTERY CRACKED
WEAK DOMINANCE: A MYSTERY CRACKED JOHN HILLAS AND DOV SAMET Abstract. What strategy profiles can be played when it is common knowledge that weakly dominated strategies are not played? A comparison to the
More informationDegrees that are not degrees of categoricity
Degrees that are not degrees of categoricity Bernard A. Anderson Department of Mathematics and Physical Sciences Gordon State College banderson@gordonstate.edu www.gordonstate.edu/faculty/banderson Barbara
More informationAn Innocent Investigation
An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number
More information6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation
6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation Daron Acemoglu and Asu Ozdaglar MIT November 2, 2009 1 Introduction Outline The problem of cooperation Finitelyrepeated prisoner s dilemma
More informationIn the situations that we will encounter, we may generally calculate the probability of an event
What does it mean for something to be random? An event is called random if the process which produces the outcome is sufficiently complicated that we are unable to predict the precise result and are instead
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationSECTION 102 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationChapter 21: The Discounted Utility Model
Chapter 21: The Discounted Utility Model 21.1: Introduction This is an important chapter in that it introduces, and explores the implications of, an empirically relevant utility function representing intertemporal
More informationFeb 7 Homework Solutions Math 151, Winter 2012. Chapter 4 Problems (pages 172179)
Feb 7 Homework Solutions Math 151, Winter 2012 Chapter Problems (pages 172179) Problem 3 Three dice are rolled. By assuming that each of the 6 3 216 possible outcomes is equally likely, find the probabilities
More informationON THE EMBEDDING OF BIRKHOFFWITT RINGS IN QUOTIENT FIELDS
ON THE EMBEDDING OF BIRKHOFFWITT RINGS IN QUOTIENT FIELDS DOV TAMARI 1. Introduction and general idea. In this note a natural problem arising in connection with socalled BirkhoffWitt algebras of Lie
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationGame Theory in Wireless Networks: A Tutorial
1 Game Theory in ireless Networks: Tutorial Mark Felegyhazi, JeanPierre Hubaux EPFL Switzerland email: {mark.felegyhazi, jeanpierre.hubaux}@epfl.ch EPFL Technical report: LCREPORT2006002, submitted
More informationBonus Maths 2: Variable Bet Sizing in the Simplest Possible Game of Poker (JB)
Bonus Maths 2: Variable Bet Sizing in the Simplest Possible Game of Poker (JB) I recently decided to read Part Three of The Mathematics of Poker (TMOP) more carefully than I did the first time around.
More informationThere is no degree invariant halfjump
There is no degree invariant halfjump Rod Downey Mathematics Department Victoria University of Wellington P O Box 600 Wellington New Zealand Richard A. Shore Mathematics Department Cornell University
More informationLarge induced subgraphs with all degrees odd
Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order
More informationMOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu
Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H1088 Budapest, Múzeum krt. 68. CONTENTS 1. SETS Set, equal sets, subset,
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationSPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM
SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM ALEX WRIGHT 1. Intoduction A fixed point of a function f from a set X into itself is a point x 0 satisfying f(x 0 ) = x 0. Theorems which establish the
More informationVon Neumann and Newman poker with a flip of hand values
Von Neumann and Newman poker with a flip of hand values Nicla Bernasconi Julian Lorenz Reto Spöhel Institute of Theoretical Computer Science ETH Zürich, 8092 Zürich, Switzerland {nicla jlorenz rspoehel}@inf.ethz.ch
More informationA set is a Many that allows itself to be thought of as a One. (Georg Cantor)
Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domains
More informationRINGS WITH A POLYNOMIAL IDENTITY
RINGS WITH A POLYNOMIAL IDENTITY IRVING KAPLANSKY 1. Introduction. In connection with his investigation of projective planes, M. Hall [2, Theorem 6.2]* proved the following theorem: a division ring D in
More informationSome Notes on Taylor Polynomials and Taylor Series
Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationMA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem
MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, and
More informationApplications of Methods of Proof
CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The settheoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are
More informationI d Rather Stay Stupid: The Advantage of Having Low Utility
I d Rather Stay Stupid: The Advantage of Having Low Utility Lior Seeman Department of Computer Science Cornell University lseeman@cs.cornell.edu Abstract Motivated by cost of computation in game theory,
More informationAnalysis of Algorithms I: Binary Search Trees
Analysis of Algorithms I: Binary Search Trees Xi Chen Columbia University Hash table: A data structure that maintains a subset of keys from a universe set U = {0, 1,..., p 1} and supports all three dictionary
More information0.0.2 Pareto Efficiency (Sec. 4, Ch. 1 of text)
September 2 Exercises: Problem 2 (p. 21) Efficiency: p. 2829: 1, 4, 5, 6 0.0.2 Pareto Efficiency (Sec. 4, Ch. 1 of text) We discuss here a notion of efficiency that is rooted in the individual preferences
More informationGoal Problems in Gambling and Game Theory. Bill Sudderth. School of Statistics University of Minnesota
Goal Problems in Gambling and Game Theory Bill Sudderth School of Statistics University of Minnesota 1 Three problems Maximizing the probability of reaching a goal. Maximizing the probability of reaching
More informationChapter 4 Lecture Notes
Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a realvalued function defined on the sample space of some experiment. For instance,
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationInternational Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013
FACTORING CRYPTOSYSTEM MODULI WHEN THE COFACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II MohammediaCasablanca,
More informationPART I. THE REAL NUMBERS
PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS
More informationWorking Paper An exact noncooperative support for the sequential Raiffa solution. Working papers // Institute of Mathematical Economics, No.
econstor www.econstor.eu Der OpenAccessPublikationsserver der ZBW LeibnizInformationszentrum Wirtschaft The Open Access Publication Server of the ZBW Leibniz Information Centre for Economics Trockel,
More informationTHOMAS S. FERGUSON, University of California, Los Angeles C. MELOLIDAKIS, Technical University of Crete
LAST ROUND BETTING THOMAS S. FERGUSON, University of California, Los Angeles C. MELOLIDAKIS, Technical University of Crete Abstract Two players with differing amounts of money simultaneously choose an
More informationCh. 13.3: More about Probability
Ch. 13.3: More about Probability Complementary Probabilities Given any event, E, of some sample space, U, of a random experiment, we can always talk about the complement, E, of that event: this is the
More informationInduction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition
Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing
More informationThéorie de la décision et théorie des jeux Stefano Moretti
héorie de la décision et théorie des jeux Stefano Moretti UMR 7243 CNRS Laboratoire d'analyse et Modélisation de Systèmes pour l'aide à la décision (LAMSADE) Université ParisDauphine email: Stefano.MOREI@dauphine.fr
More informationThe Kelly Betting System for Favorable Games.
The Kelly Betting System for Favorable Games. Thomas Ferguson, Statistics Department, UCLA A Simple Example. Suppose that each day you are offered a gamble with probability 2/3 of winning and probability
More informationGraphs without proper subgraphs of minimum degree 3 and short cycles
Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Week 7 Lecture Notes Discrete Probability Continued Note Binomial coefficients are written horizontally. The symbol ~ is used to mean approximately equal. The Bernoulli
More informationNash and game theory
Nash and game theory Antonio Cabrales 1 I am asked to give my view on the contribution of John Nash to the development of game theory. Since I have received most of my early influence through textbooks,
More informationTOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS
TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS VIPUL NAIK Abstract. In this journey, we are going to explore the so called separation axioms in greater detail. We shall try to understand how these axioms
More informationAN INTRODUCTION TO GAME THEORY
AN INTRODUCTION TO GAME THEORY 2008 AGIInformation Management Consultants May be used for personal purporses only or by libraries associated to dandelon.com network. MARTIN J. OSBORNE University of Toronto
More information