Monty Hall Problem and the Principle of Equal Probability in Measurement Theory

Total Page:16

File Type:pdf, Size:1020Kb

Load more

Applied Mathematics, 2012, 3, 788-794 http://dx.doi.org/10.4236/am.2012.37117 Published Online July 2012 (http://www.SciRP.org/journal/am) Monty Hall Problem and the Principle of Equal Probability in Measurement Theory Shiro Ishikawa Department of Mathematics, Faculty of Science and Technology, Keio University, Yokohama, Japan Email: [email protected] Received April 28, 2012; revised May 28, 2012; accepted June 5, 2012 ABSTRACT In this paper, we study the principle of equal probability (i.e., unless we have sufficient reason to regard one possible case as more probable than another, we treat them as equally probable) in measurement theory (i.e., the theory of quan- tum mechanical world view), which is characterized as the linguistic turn of quantum mechanics with the Copenhagen interpretation. This turn from physics to language does not only realize the remarkable extension of quantum mechanics but also establish the method of science. Our study will be executed in the easy example of the Monty Hall problem. Although our argument is simple, we believe that it is worth pointing out the fact that the principle of equal probability can be, for the first time, clarified in measurement theory (based on the dualism) and not the conventional statistics (based on Kolmogorov’s probability theory). Keywords: Linguistic Interpretation; Quantum and Classical Measurement Theory; Philosophy of Statistics; Fisher Maximum Likelihood Method; Bayes’ Theorem 1. Introduction (cf. Figure 1: ③ later), constructed as the scientific the- ory formulated in a certain C*-algebra A (i.e., a norm 1.1. Monty Hall Problem closed subalgebra in the operator algebra BH com- The Monty Hall problem is well-known and elementary. posed of all bounded operators on a Hilbert space H, cf. Also it is famous as the problem in which even great [14,15]). MT is composed of two theories (i.e., pure mathematician P. Erdös made a mistake (cf. [1]). The measurement theory (or, in short, PMT] and statistical Monty Hall problem is as follows: measurement theory (or, in short, SMT). That is, it has Problem 1 [Monty Hall problem 1]. You are on a the following structure: game show and you are given the choice of three doors. (A) MT (measurement theory) Behind one door is a car, and behind the other two are A:PMT1 goats. You choose, say, door 1, and the host, who knows where the car is, opens another door, behind which is a pure measurement causality goat. For example, the host says that AxiomP 1 Axiom2 (♭) the door 3 has a goat. And further, He now gives you the choice of sticking with door 1 or switching to door 2? What should you do? A:SMT In the framework of measurement theory [2-12], we 2 statistical measurement + causality shall present two answers of this problem in Sections 3.1 and 4.2. Although this problem seems elementary, we S Axiom 1 Axiom2 assert that the complete understanding of the Monty Hall problem can not be acquired within Kolmogorov’s prob- where Axiom 2 is common in PMT and SMT. For com- ability theory [13] but measurement theory (based on the pleteness, note that measurement theory (A) (i.e., (A ) dualism). 1 and (A2)) is not physics but a kind of language based on “the (quantum) mechanical world view”. As seen in [9], 1.2. Overview: Measurement Theory note that MT gives a foundation to statistics. That is, As emphasized in refs. [7,8], measurement theory (or in roughly speaking, short, MT) is, by a linguistic turn of quantum mechanics (B) it may be understandabl e to consider that PMT and Copyright © 2012 SciRes. AM S. ISHIKAWA 789 Figure 1. The development of the world views from our standing point. For the explanation of (①-⑧), see [8,10]. SMT is related to Fisher’s statistics and Bayesian statis- f 1 . The bi-linear functional f is also de- tics respectively. CΩ Also, for the position of MT in science, see Figure 1, noted by , f , or in short , f . CΩ * CΩ which was precisely explained in [8,10]. When A BH, the C*-algebra composed of all * c Define the mixed state C Ω such that compact operators on a Hilbert space H, the (A) is called * 1 and f 0 for all fC Ω such that quantum measurement theory (or, quantum system the- CΩ ory), which can be regarded as the linguistic aspect of f 0 . And put quantum mechanics. Also, when A is commutative (that * is, when A is characterized by C Ω , the C -algebra m ** 0 SCΩΩ C is a mixed state . composed of all continuous complex-valued functions vanishing at infinity on a locally compact Hausdorff Also, for each Ω , define the pure state space Ω (cf. [16])), the (A) is called classical meas- SCm Ω * such that urement theory. Thus, we have the following classifica- * , fffC Ω. And put tion: CΩ CΩ quantum MT when A BH c p ** (C) MT SC ΩΩ C is a pure state , classical MT when ACΩ 0 which is called a state space. Note, by the Riesz theorem The purpose of this paper is to clarify the Monty Hall * problem in the classical PMT and classical SMT. (cf. [16]), that CM(Ω)(Ω) is a signed meas- ure on Ω and SCmmΩΩ* M is a meas- 2. Classical Measurement Theory (Axioms 1 and Interpretation) ure on Ω such that Ω 1 . Also, it is clear that 2.1. Mathematical Preparations SCp Ω * is a point measure at Ω , 00 0 Since our concern is the Monty Hall problem, we devote where ff d fCΩ . This im- 0 0 ourselves to classical MT in (C). Throughout this paper, Ω we assume that Ω is a compact Hausdorff space. Thus, plies that the state space SCp Ω * can be also iden- we can put C0 Ω CΩ, which is defined by a Ba- * nach space (or precisely, a commutative C -algebra) tified with Ω (called a spectrum space or simply, spec- composed of all continuous complex-valued functions on trum) such as a compact Hausdorff space Ω , where its norm f CΩ p * ∋ SC ΩΩ is defined by max f . Let C Ω * be the dual Ba- (1) Ω state space spectrum * nach space of C Ω . That is, C Ω is a con- Also, note that C Ω is unital, i.e., it has the identity I (or precisely, I ), since we assume that Ω is com- tinuous linear functional on C Ω , and the norm CΩ pact. * is defined by sup ff: CΩ such that According to the noted idea (cf. [17]) in quantum me- CΩ Copyright © 2012 SciRes. AM 790 S. ISHIKAWA chanics, an observable OXBF:,, X in C Ω is ciated. 2 defined as follows: (E2) For every tt, T, a Markov operator X 12 (D1) [Field] X is a set, BX (2 , the power set of X) Φ : CΩ CΩ is defined (i.e., Φ 0, is a field of X, that is, “ 12, BBXX1 2 ”, tt12, t2 t1 tt12, “ ΞΞBXXX B”. Φ I I). And it satisfies that ΦΦ (D2) [Additivity] F is a mapping from B to C Ω tt12, CΩCΩ tt23,,tt13 X tt21 satisfying: 1): for every Ξ B , F Ξ is a non-nega- X holds for any tt, , tt, T2 . tive element in C Ω such that 0 F Ξ I , 2): 12 23 F 0 and F X I, where 0 and I is the 0-ele- The family of dual operators ment and the identity in C Ω respectively. 3): for any ** * mm Ξ , Ξ B such that ΞΞ , it holds that Φtt, : SCΩΩ t SC t 1 2 X 12 12 1 2 2 tt12, T FFΞΞ12 Ξ 1FΞ 2. For the more precise argument (such as countably ad- is called a dual causal relation (due to the Schrödinger ditivity, etc.), see [7,9]. picture). When ** * pp 2.2. Classical PMT in (A1) ΦΩtt, SC t SC Ω t 12 1 2 In this section we shall explain classical PMT in (A1). 2 * holds for any tt, T, the causal relation is said to With any system S, a commutative C -algebra C Ω 12 be deterministic. can be associated in which the measurement theory (A) Here, Axiom 2 in the measurement theory (A) is pre- of that system can be formulated. A state of the system S sented as follows: is represented by an element SCp Ω * and an Axiom 2 [Causality]. The causality is represented by a causal relation Φ : CCΩΩ . observable is represented by an observable tt12, t 2t 1 2 tt12, T OXBF:,, in C Ω . Also, the measurement of * X For the further argument (i.e., the W -algebraic formu- the observable O for the system S with the state is lation) of measurement theory, see Appendix in [7]. denoted by MOS, or more precisely, CΩ 2.3. Classical SMT in (A2) MO:,,, XBFS . An observer can obtain CΩ X It is usual to consider that we do not know the state 0 a measured value x X by the measurement when we take a measurement MOS, . That is C MO, S. 0 CΩ P because we usually take a measurement MO , S The Axiom 1 presented below is a kind of mathe- C 0 matical generalization of Born’s probabilistic interpreta- in order to know the state . Thus, when we want to tion of quantum mechanics. And thus, it is a statement 0 without reality. emphasize that we do not know the the state , 0 AxiomP 1 [Measurement]. The probability that a mea- sured value x X obtained by the measurement MOS, is denoted by M OS, .
Recommended publications
  • Game Theory Lecture Notes

    Game Theory Lecture Notes

    Game Theory: Penn State Math 486 Lecture Notes Version 2.1.1 Christopher Griffin « 2010-2021 Licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 United States License With Major Contributions By: James Fan George Kesidis and Other Contributions By: Arlan Stutler Sarthak Shah Contents List of Figuresv Preface xi 1. Using These Notes xi 2. An Overview of Game Theory xi Chapter 1. Probability Theory and Games Against the House1 1. Probability1 2. Random Variables and Expected Values6 3. Conditional Probability8 4. The Monty Hall Problem 11 Chapter 2. Game Trees and Extensive Form 15 1. Graphs and Trees 15 2. Game Trees with Complete Information and No Chance 18 3. Game Trees with Incomplete Information 22 4. Games of Chance 24 5. Pay-off Functions and Equilibria 26 Chapter 3. Normal and Strategic Form Games and Matrices 37 1. Normal and Strategic Form 37 2. Strategic Form Games 38 3. Review of Basic Matrix Properties 40 4. Special Matrices and Vectors 42 5. Strategy Vectors and Matrix Games 43 Chapter 4. Saddle Points, Mixed Strategies and the Minimax Theorem 45 1. Saddle Points 45 2. Zero-Sum Games without Saddle Points 48 3. Mixed Strategies 50 4. Mixed Strategies in Matrix Games 53 5. Dominated Strategies and Nash Equilibria 54 6. The Minimax Theorem 59 7. Finding Nash Equilibria in Simple Games 64 8. A Note on Nash Equilibria in General 66 Chapter 5. An Introduction to Optimization and the Karush-Kuhn-Tucker Conditions 69 1. A General Maximization Formulation 70 2. Some Geometry for Optimization 72 3.
  • Frequently Asked Questions in Mathematics

    Frequently Asked Questions in Mathematics

    Frequently Asked Questions in Mathematics The Sci.Math FAQ Team. Editor: Alex L´opez-Ortiz e-mail: [email protected] Contents 1 Introduction 4 1.1 Why a list of Frequently Asked Questions? . 4 1.2 Frequently Asked Questions in Mathematics? . 4 2 Fundamentals 5 2.1 Algebraic structures . 5 2.1.1 Monoids and Groups . 6 2.1.2 Rings . 7 2.1.3 Fields . 7 2.1.4 Ordering . 8 2.2 What are numbers? . 9 2.2.1 Introduction . 9 2.2.2 Construction of the Number System . 9 2.2.3 Construction of N ............................... 10 2.2.4 Construction of Z ................................ 10 2.2.5 Construction of Q ............................... 11 2.2.6 Construction of R ............................... 11 2.2.7 Construction of C ............................... 12 2.2.8 Rounding things up . 12 2.2.9 What’s next? . 12 3 Number Theory 14 3.1 Fermat’s Last Theorem . 14 3.1.1 History of Fermat’s Last Theorem . 14 3.1.2 What is the current status of FLT? . 14 3.1.3 Related Conjectures . 15 3.1.4 Did Fermat prove this theorem? . 16 3.2 Prime Numbers . 17 3.2.1 Largest known Mersenne prime . 17 3.2.2 Largest known prime . 17 3.2.3 Largest known twin primes . 18 3.2.4 Largest Fermat number with known factorization . 18 3.2.5 Algorithms to factor integer numbers . 18 3.2.6 Primality Testing . 19 3.2.7 List of record numbers . 20 3.2.8 What is the current status on Mersenne primes? .
  • The Monty Hall Problem in the Game Theory Class

    The Monty Hall Problem in the Game Theory Class

    The Monty Hall Problem in the Game Theory Class Sasha Gnedin∗ October 29, 2018 1 Introduction Suppose you’re on a game show, and you’re given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what’s behind the doors, opens another door, say No. 3, which has a goat. He then says to you, “Do you want to pick door No. 2?” Is it to your advantage to switch your choice? With these famous words the Parade Magazine columnist vos Savant opened an exciting chapter in mathematical didactics. The puzzle, which has be- come known as the Monty Hall Problem (MHP), has broken the records of popularity among the probability paradoxes. The book by Rosenhouse [9] and the Wikipedia entry on the MHP present the history and variations of the problem. arXiv:1107.0326v1 [math.HO] 1 Jul 2011 In the basic version of the MHP the rules of the game specify that the host must always reveal one of the unchosen doors to show that there is no prize there. Two remaining unrevealed doors may hide the prize, creating the illusion of symmetry and suggesting that the action does not matter. How- ever, the symmetry is fallacious, and switching is a better action, doubling the probability of winning. There are two main explanations of the paradox. One of them, simplistic, amounts to just counting the mutually exclusive cases: either you win with ∗[email protected] 1 switching or with holding the first choice.
  • Game, Set, and Match Carl W

    Game, Set, and Match Carl W

    Game, Set, and Match Carl W. Lee September 2016 Note: Some of the text below comes from Martin Gardner's articles in Scientific American and some from Mathematical Circles by Fomin, Genkin, and Itenberg. 1 1 Fifteen This is a two player game. Take a set of nine cards, numbered one (ace) through nine. They are spread out on the table, face up. Players alternately select a card to add their hands, which they keep face up in front of them. The goal is to achieve a subset of three cards in your hand so that the values of these three cards sum to exactly fifteen. (The ace counts as 1.) This is an example of a game that is isomorphic to (the \same as") a well-known game: Tic-Tac-Toe. Number the cells of a tic-tac-toe board with the integers from 1 to 9 arranged in the form of a magic square. 8 1 6 3 5 7 4 9 2 Then winning combinations correspond exactly to triples of numbers that sum to 15. This is a combinatorial two person game (but one that permits ties). There is no hidden information (e.g., cards that one player has that the other cannot see) and no random elements (e.g., rolling of dice). 2 2 Ones and Twos Ten 1's and ten 2's are written on a blackboard. In one turn, a player may erase (or cross out) any two numbers. If the two numbers erased are identical, they are replaced with a single 2.
  • Introduction to Probability 1 Monty Hall

    Introduction to Probability 1 Monty Hall

    Massachusetts Institute of Technology Course Notes, Week 12 6.042J/18.062J, Fall ’05: Mathematics for Computer Science November 21 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised November 29, 2005, 1285 minutes Introduction to Probability Probability is the last topic in this course and perhaps the most important. Many algo­ rithms rely on randomization. Investigating their correctness and performance requires probability theory. Moreover, many aspects of computer systems, such as memory man­ agement, branch prediction, packet routing, and load balancing are designed around probabilistic assumptions and analyses. Probability also comes up in information theory, cryptography, artificial intelligence, and game theory. Beyond these engineering applica­ tions, an understanding of probability gives insight into many everyday issues, such as polling, DNA testing, risk assessment, investing, and gambling. So probability is good stuff. 1 Monty Hall In the September 9, 1990 issue of Parade magazine, the columnist Marilyn vos Savant responded to this letter: Suppose you’re on a game show, and you’re given the choice of three doors. Behind one door is a car, behind the others, goats. You pick a door, say number 1, and the host, who knows what’s behind the doors, opens another door, say number 3, which has a goat. He says to you, ”Do you want to pick door number 2?” Is it to your advantage to switch your choice of doors? Craig. F. Whitaker Columbia, MD The letter roughly describes a situation faced by contestants on the 1970’s game show Let’s Make a Deal, hosted by Monty Hall and Carol Merrill.
  • The Monty Hall Problem

    The Monty Hall Problem

    The Monty Hall Problem Richard D. Gill Mathematical Institute, University of Leiden, Netherlands http://www.math.leidenuniv.nl/∼gill 17 March, 2011 Abstract A range of solutions to the Monty Hall problem is developed, with the aim of connecting popular (informal) solutions and the formal mathematical solutions of in- troductory text-books. Under Riemann's slogan of replacing calculations with ideas, we discover bridges between popular solutions and rigorous (formal) mathematical solutions by using various combinations of symmetry, symmetrization, independence, and Bayes' rule, as well as insights from game theory. The result is a collection of intuitive and informal logical arguments which can be converted step by step into formal mathematics. The Monty Hall problem can be used simultaneously to develop probabilistic intuition and to give a deeper understanding of the paradox, not just to provide a routine exercise in computation of conditional probabilities. Simple insights from game theory can be used to prove probability inequalities. Acknowledgement: this text is the result of an evolution through texts written for three internet encyclopedias (wikipedia.org, citizendium.org, statprob.com) and each time has benefitted from the contributions of many other editors. I thank them all, for all the original ideas in this paper. That leaves only the mistakes, for which I bear responsibility. 1 Introduction Imagine you are a guest in a TV game show. The host, a certain Mr. Monty Hall, shows you three large doors and tells you that behind one of the doors there is a car while behind the other two there are goats. You want to win the car.
  • Introduction to Game Theory I

    Introduction to Game Theory I

    Introduction to Game Theory I Presented To: 2014 Summer REU Penn State Department of Mathematics Presented By: Christopher Griffin [email protected] 1/34 Types of Game Theory GAME THEORY Classical Game Combinatorial Dynamic Game Evolutionary Other Topics in Theory Game Theory Theory Game Theory Game Theory No time, doesn't contain differential equations Notion of time, may contain differential equations Games with finite or Games with no Games with time. Modeling population Experimental / infinite strategy space, chance. dynamics under Behavioral Game but no time. Games with motion or competition Theory Generally two player a dynamic component. Games with probability strategic games Modeling the evolution Voting Theory (either induced by the played on boards. Examples: of strategies in a player or the game). Optimal play in a dog population. Examples: Moves change the fight. Chasing your Determining why Games with coalitions structure of a game brother across a room. Examples: altruism is present in or negotiations. board. The evolution of human society. behaviors in a group of Examples: Examples: animals. Determining if there's Poker, Strategic Chess, Checkers, Go, a fair voting system. Military Decision Nim. Equilibrium of human Making, Negotiations. behavior in social networks. 2/34 Games Against the House The games we often see on television fall into this category. TV Game Shows (that do not pit players against each other in knowledge tests) often require a single player (who is, in a sense, playing against The House) to make a decision that will affect only his life. Prize is Behind: 1 2 3 Choose Door: 1 2 3 1 2 3 1 2 3 Switch: Y N Y N Y N Y N Y N Y N Y N Y N Y N Win/Lose: L W W L W L W L L W W L W L W L L W The Monty Hall Problem Other games against the house: • Blackjack • The Price is Right 3/34 Assumptions of Multi-Player Games 1.
  • The Monty Hall Problem Yurixy Lopez Martinez a Project Presented for The

    The Monty Hall Problem Yurixy Lopez Martinez a Project Presented for The

    The Monty Hall Problem Yurixy Lopez Martinez A project presented for the degree of Bachelors of Arts, Mathematics Mathematics Department Whitman College Walla Walla, WA May 10, 2019 Abstract This paper begins by offering a detailed explanation of the solution to the Monty Hall Problem utilizing decision trees and mathematical concepts of conditional probability, mainly Bayes' Theorem. We will proceed to investigate the various versions of the problem that have risen throughout the years among scholars, mainly focusing on the benefits of a particular strategies. We will conclude by briefly discussing some applications of the Monty Hall Problem to other disciplines, mainly the probabilistic aspects. 1 Contents 1 Introduction 3 2 Monty Hall Problem 4 3 Why Switch? 5 4 Conditional Probability: Bayes' Theorem 7 5 Bayesian Monty 9 6 Variations of the Monty Hall Problem 10 6.1 Monty Chooses Randomly . 10 6.2 Highest-Ordered Selection . 11 6.3 Many doors . 14 6.3.1 Alternative Solution . 16 6.4 Many Doors, Many Cars . 17 6.5 Random Car Placement . 18 6.6 Two Contestants . 19 7 Applications of Monty Hall Problem 19 7.1 Philosophy . 20 7.2 Physics . 20 7.3 Economics . 21 7.4 Cognitive Science and Psychology . 21 8 Conclusion 21 9 Acknowledgements 22 2 1 Introduction The Monty Hall Problem is a recognized probability problem. The canonical, classical version of the problem is described as follows: A contestant is shown three identical doors. Behind one of them is a car. The other two conceal goats. The contestant is asked to choose, but not open, one of the doors.
  • The Monty Hall Problem As a Bayesian Game

    The Monty Hall Problem As a Bayesian Game

    Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 25 May 2017 doi:10.20944/preprints201705.0187.v1 Peer-reviewed version available at Games 2017, 8, 31; doi:10.3390/g8030031 The Monty Hall Problem as a Bayesian Game Mark Whitmeyer∗ Department of Economics, University of Texas at Austin, Austin, TX 78712, USA Abstract This paper formulates the classic Monty Hall problem as a Bayesian game. Allowing Monty a small amount of freedom in his decisions facilitates a variety of solutions. The solution concept used is the Bayes Nash Equilibrium (BNE), and the set of BNE relies on Monty's motives and incentives. We endow Monty and the contestant with common prior probabilities (p) about the motives of Monty, and show that under certain conditions on p, the unique equilibrium is one where the contestant is indifferent between switching and not switching. This coincides and agrees with the typical responses and explanations by experimental subjects. Finally, we show that our formulation can explain the experimental results in Page (1998) [12]; that more people gradually choose switch as the number of doors in the problem increases. Keywords: Monty Hall; Equiprobability Bias; games of incomplete information; Bayes Nash Equilibrium JEL Classification: C60, C72, D81, D82 ∗Email: [email protected] 1 © 2017 by the author(s). Distributed under a Creative Commons CC BY license. Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 25 May 2017 doi:10.20944/preprints201705.0187.v1 Peer-reviewed version available at Games 2017, 8, 31; doi:10.3390/g8030031 1 Introduction The \Monty Hall" problem is a famous scenario in decision theory.
  • Quantum PBR Theorem As a Monty Hall Game

    Quantum PBR Theorem As a Monty Hall Game

    quantum reports Article Quantum PBR Theorem as a Monty Hall Game Del Rajan * and Matt Visser School of Mathematics and Statistics, Victoria University of Wellington, Wellington 6140, New Zealand; [email protected] * Correspondence: [email protected] Received: 21 November 2019; Accepted: 27 December 2019; Published: 31 December 2019 Abstract: The quantum Pusey–Barrett–Rudolph (PBR) theorem addresses the question of whether the quantum state corresponds to a y-ontic model (system’s physical state) or to a y-epistemic model (observer’s knowledge about the system). We reformulate the PBR theorem as a Monty Hall game and show that winning probabilities, for switching doors in the game, depend on whether it is a y-ontic or y-epistemic game. For certain cases of the latter, switching doors provides no advantage. We also apply the concepts involved in quantum teleportation, in particular for improving reliability. Keywords: Monty Hall game; PBR theorem; entanglement; teleportation; psi-ontic; psi-epistemic PACS: 03.67.Bg; 03.67.Dd; 03.67.Hk; 03.67.Mn 1. Introduction No-go theorems in quantum foundations are vitally important for our understanding of quantum physics. Bell’s theorem [1] exemplifies this by showing that locally realistic models must contradict the experimental predictions of quantum theory. There are various ways of viewing Bell’s theorem through the framework of game theory [2]. These are commonly referred to as nonlocal games, and the best known example is the CHSHgame; in this scenario, the participants can win the game at a higher probability with quantum resources, as opposed to having access to only classical resources.
  • Analyzing the Price Is Right

    Analyzing the Price Is Right

    Analyzing The Price is Right A Major Qualifying Project Submitted to the faculty of Worcester Polytechnic Institute in partial fulfillment of the requirements for the Degree of Bachelor of Science By: __________________________________ __________________________________ Corey O’Malley Marshall Patrolia Approved by: Barry Posterro Jon Abraham Date: April 24, 2019 This report represents work of WPI undergraduate students submitted to the faculty as evidence of a degree requirement. WPI routinely publishes these reports on its web site without editorial or peer review. For more information about the projects program at WPI, see http://www.wpi.edu/Academics/Projects ` Abstract The purpose of this MQP is to analyze all the games on The Price is Right and find strategies to improve the constant’s probability of winning assuming they have no pricing knowledge. Using analytics and simulations, every game was analyzed and put in categories of low, medium, or high strategy. The project includes a catalog of all the current Price is Right games, including a description of the game; the strategy that should be implemented to improve the contestant’s odds; and the probability of winning with and without strategy. 1 ` Acknowledgements We would like to thank our advisors Barry Posterro and Jon Abraham for their time and guidance during this project. 2 ` Table of Contents Abstract ........................................................................................................................................... 1 Acknowledgements ........................................................................................................................
  • New Models of Quantum Games

    New Models of Quantum Games

    New models of quantum games Paulo Benício Melo de Sousa *Rubens Viana Ramos and José Tarcísio Costa Filho Department of Teleinformatic Engineering, Federal University of Ceara, Campus do Pici, 710, C.P. 6007, 60755-640, Fortaleza-Ceará, Brazil Abstract In this work we propose and develop modified quantum games (zero and non-zero sum) in which payoffs and strategies are entangled. For the games studied, Nash and Pareto equilibriums are always obtained indicating that there are some interesting cases where quantum games can be applied. PACS: 03.67.Dd Keywords: Quantum games, entanglement, quantum circuits Quantum games were introduced by Meyer [1] and Eisert [2] as generalization of classical games [3,4]. Some interesting implementations of quantum games based on the use of entanglement have been proposed [5-7], even thought some authors consider that it does not represent a requirement for quantum games [8]. Most quantum games proposed are versions of their classical counterpart as, for instance, PQ penny flip [1], quantum battle of sexes [9], quantum Monty Hall problem [10], quantum market games [11], quantum Parrondo games [12] and, the most famous, the quantum prisoner’s dilemma [2- 6,12,13]. Basically, in a game, two (or more) players are trying to reach a final state which ensures them the best benefit, acting individually or cooperating with other players. The common representation of a game consists of a set of rational k players (k2) k and a allowed set of strategies s , each strategy profile implying in a payoff value ( i ) ($k). ____________________ *Corresponding author E-mail addresses: [email protected], [email protected], [email protected] The players choose the strategies aiming to obtain the best payoff value.