Instructions [CT+PT Treatment]

Similar documents
Multidimensional Ellsberg: Online Appendix

Sample Instructions and Screenshots

The point value of each problem is in the left-hand margin. You must show your work to receive any credit, except on problems 1 & 2. Work neatly.

Math 152: Applicable Mathematics and Computing

Section Summary. Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning

Math 1313 Section 6.2 Definition of Probability

The study of probability is concerned with the likelihood of events occurring. Many situations can be analyzed using a simplified model of probability

Roommate & Room Selection Process

Suppose Y is a random variable with probability distribution function f(y). The mathematical expectation, or expected value, E(Y) is defined as:

Name: Final Exam May 7, 2014

8.2 Union, Intersection, and Complement of Events; Odds

4.3 Rules of Probability

Experimental Instructions

Determine whether the given events are disjoint. 4) Being over 30 and being in college 4) A) No B) Yes

The Teachers Circle Mar. 20, 2012 HOW TO GAMBLE IF YOU MUST (I ll bet you $5 that if you give me $10, I ll give you $20.)

Simulations. 1 The Concept

Math 106 Lecture 3 Probability - Basic Terms Combinatorics and Probability - 1 Odds, Payoffs Rolling a die (virtually)

INDEPENDENT AND DEPENDENT EVENTS UNIT 6: PROBABILITY DAY 2

CHAPTER 7 Probability

Probability Rules. 2) The probability, P, of any event ranges from which of the following?

Supplementary Information for Viewing men s faces does not lead to accurate predictions of trustworthiness

Saturday Morning Math Group October 27, Game Theory and Knowing about Knowledge PACKET A

4.1 Sample Spaces and Events

Waiting Times. Lesson1. Unit UNIT 7 PATTERNS IN CHANCE

CS1802 Week 9: Probability, Expectation, Entropy

Discrete Structures for Computer Science

Team Round University of South Carolina Math Contest, 2018

Math 4610, Problems to be Worked in Class

November 11, Chapter 8: Probability: The Mathematics of Chance

CSC/MTH 231 Discrete Structures II Spring, Homework 5

Problem 1 (15 points: Graded by Shahin) Recall the network structure of our in-class trading experiment shown in Figure 1

Contemporary Mathematics Math 1030 Sample Exam I Chapters Time Limit: 90 Minutes No Scratch Paper Calculator Allowed: Scientific

Section Introduction to Sets

1. For which of the following sets does the mean equal the median?

The probability set-up

Assignment 5 due Monday, May 7

Week in Review #5 ( , 3.1)

Module 5: Probability and Randomness Practice exercises

ECE313 Summer Problem Set 4. Reading: RVs, mean, variance, and coniditional probability

PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo

EXAM. Exam #1. Math 3371 First Summer Session June 12, 2001 ANSWERS

EE 126 Fall 2006 Midterm #1 Thursday October 6, 7 8:30pm DO NOT TURN THIS PAGE OVER UNTIL YOU ARE TOLD TO DO SO

Probability Paradoxes

Unit 9: Probability Assignments

November 6, Chapter 8: Probability: The Mathematics of Chance

The probability set-up

Due Friday February 17th before noon in the TA drop box, basement, AP&M. HOMEWORK 3 : HAND IN ONLY QUESTIONS: 2, 4, 8, 11, 13, 15, 21, 24, 27

Day 5: Mutually Exclusive and Inclusive Events. Honors Math 2 Unit 6: Probability

Probability. March 06, J. Boulton MDM 4U1. P(A) = n(a) n(s) Introductory Probability

Math 147 Lecture Notes: Lecture 21

Laboratory 1: Uncertainty Analysis

Probability. The MEnTe Program Math Enrichment through Technology. Title V East Los Angeles College

3 The multiplication rule/miscellaneous counting problems

( ) Online MC Practice Quiz KEY Chapter 5: Probability: What Are The Chances?

Math 1070 Sample Exam 2

BLOGGER BLOG FOR BEGINNERS

final examination on May 31 Topics from the latter part of the course (covered in homework assignments 4-7) include:

Date. Probability. Chapter

Probability and Counting Techniques

Video Speed is not Important,

Exam III Review Problems

For question 1 n = 5, we let the random variable (Y) represent the number out of 5 who get a heart attack, p =.3, q =.7 5

Chapter 7 Homework Problems. 1. If a carefully made die is rolled once, it is reasonable to assign probability 1/6 to each of the six faces.

Computational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 3 Fall 2010

2016 Camp Card Sale Guide

Problem F. Chessboard Coloring

12.1 The Fundamental Counting Principle and Permutations

Setting Up Roommate Groups

Welcome to 6 Trait Power Write!

PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo

The Ultimate Money Making System *** Earn a Living Stealing From the Casino ***

Begin this assignment by first creating a new Java Project called Assignment 5.There is only one part to this assignment.

Randomness Exercises

At regular intervals, the team reflects on how to become more effective, then tunes and adjusts its behavior accordingly.

Week 3 Classical Probability, Part I

Problem 1. Imagine that you are being held captive in a dungeon by an evil mathematician with

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2014 Prof. Michael Kearns

PROBLEM SET 2 Due: Friday, September 28. Reading: CLRS Chapter 5 & Appendix C; CLR Sections 6.1, 6.2, 6.3, & 6.6;

Probability: Anticipating Patterns

2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC)

2. The Extensive Form of a Game

a) Getting 10 +/- 2 head in 20 tosses is the same probability as getting +/- heads in 320 tosses

PROBLEM SET Explain the difference between mutual knowledge and common knowledge.

Theory of Probability - Brett Bernstein

Mathacle. Name: Date:

Econ 302: Microeconomics II - Strategic Behavior. Problem Set #5 June13, 2016

Chapter 4: Probability

Such a description is the basis for a probability model. Here is the basic vocabulary we use.

Sampling Terminology. all possible entities (known or unknown) of a group being studied. MKT 450. MARKETING TOOLS Buyer Behavior and Market Analysis

HW4: The Game of Pig Due date: Thursday, Oct. 29 th at 9pm. Late turn-in deadline is Tuesday, Nov. 3 rd at 9pm.

HW4: The Game of Pig Due date: Tuesday, Mar 15 th at 9pm. Late turn-in deadline is Thursday, Mar 17th at 9pm.

Probability MAT230. Fall Discrete Mathematics. MAT230 (Discrete Math) Probability Fall / 37

Smyth County Public Schools 2017 Computer Science Competition Coding Problems

Math Steven Noble. November 22nd. Steven Noble Math 3790

Lecture 6: Basics of Game Theory

1 of 6 9/4/2012 6:43 PM

Conditional Probability Worksheet

These Are a Few of My Favorite Things

7.1 Experiments, Sample Spaces, and Events

1. Express the reciprocal of 0.55 as a common fraction. 1.

Transcription:

Instructions [CT+PT Treatment] 1. Overview Welcome to this experiment in the economics of decision-making. Please read these instructions carefully as they explain how you earn money from the decisions you make in today s experiment. There is no talking for the duration of today s session. If you have a cell phone, please turn the ringer off. Today s session consists of a number of sequences. Each sequence consists of a number of rounds. At the start of each sequence the computer program will randomly assign all participants to a 5-member group. All random groupings of 5 participants are equally likely. Once you are assigned to a 5-member group, you will play all rounds of the sequence with the same 4 other members of your 5-member group. At the start of each new sequence, the computer program will again randomly assign players to 5-member groups. Your interactions with other participants is always anonymous; you will not be informed of the identity of any group member in any sequence played, nor will they be informed of your identity, even after today s session is over. Prior to the first round of each new sequence, the program randomly selects one member of your 5- member group and assigns that person the role of Player A. The other 4 members of your group are assigned the role of Player B. You and the other members of your group will remain in the same role of Player A or Player B for all rounds of the sequence. At the start of each new sequence, the computer program will once again assign roles randomly among the members of your new 5-member group, and you will remain in your new role for the duration of that new sequence. 2. The decisions to be made Imagine there are two containers labeled Container 1 and Container 2. At the start of each round, Container 1 holds W 0 gallons of water while Container 2 is empty. At the start of each round, Player A is privately informed of the amount of water, W 0, held in Container 1. Player A must then send a message to the four B players about how much water he or she intends to move from Container 1 to Container 2. This message, however, is not binding on Player A s actual choice. Next, Player Bs receive the message from Player A. Each Player B must then submit his or her forecast as to how many gallons of water there will be in Container 2 at the end of the round. After all Player Bs have made their forecasts, the computer program calculates the average of the four Player B forecasts, which we denote by af for average forecast. This average forecast is added to the amount of water in Container 1 so that the total amount of water in Container 1 is now W 0 + af. Next, the Player A in the group learns af and therefore the new total amount of water in Container 1, W 0 + af. Then, the Player A can move from 0 to 80 gallons of water from Container 1 to Container 2. Denote the amount of water moved by M ( Moved ). Note that it is up to Player A whether he or she moves as much water as previously announced. Player A can move the announced amount or more or less water. 1

In addition, there is a random, uncontrolled flow of water, V, from Container 1 to Container 2 that Player A does not know about when choosing M. Thus, the final amount of water in Container 1 is W 0 + af M V and the final amount of water in Container 2 is M + V. 2.1. Specific details The initial water level in Container 1, W 0, is a random variable. For each round of a sequence, the computer program draws a value of W 0 randomly and independently from a uniform distribution over the interval [120, 160]. This means that the minimum possible value of W 0 is 120 and the maximum possible value of W 0 is 160. All numbers between 120 and 160 inclusive have an equal chance of being drawn, so the expected value of W 0 is 140. In each round, Player A moves first. Player A alone observes the actual amount of water, W 0, in Container 1 and must send a message to the four player Bs about how much water he or she intends to move from Container 1 to Container 2. This message, however, is not binding on Player A s actual choice. Player A s message must be a number from 0 to 80 (inclusive). Player A should type his or her message in the blue input box on their decision screen when prompted. Click the red Submit button when satisfied with your choice. Next, Player Bs receive the message from Player A, of the form: The amount of water I intend to move from Container 1 to Container 2 is. Each Player B must then submit his or her own forecast, f, of the final amount of water that will be in Container 2 at the end of the round. Recall that Container 2 is initially empty. Forecasts may range from 0 to 120 gallons of water inclusive in Container 2. Player Bs should type their forecast in the blue input box on their decision screen when prompted. Click the red Submit button when satisfied with your choice. Note that Player Bs do not precisely know the value of W 0 when making their forecasts. They do know that W 0 is a uniform random draw from the interval [120, 160] and they also know Player A s message. After all four Player Bs have entered their forecasts, the computer program calculates the average value of the four forecasts. Let us denote this average forecast by af. Then, af gallons of water are added to Container 1. Thus, the average forecast increases the amount of water in Container 1. The total amount of water in Container 1 is now W 0 + af. Next, Player A alone is informed of the average forecast, af, for the round. In addition, Player A is reminded of this round s value of W 0, is told the new amount of water in Container 1, W 0 + af and is reminded of the message he sent to the four player Bs at the beginning of the round regarding the amount of water s/he intended to move. After observing the values of af and W 0, the Player A in each group must decide how much water to move from Container 1 to the empty Container 2. The amount moved by Player A is denoted by M. Player A can move up to 80 gallons of water inclusive from Container 1 to Container 2 in each round. Player A should type his or her choice for M in the blue input box on the decision screen when prompted. Click the red Submit button when satisfied with your choice. Note again that the message that Player A has sent at the beginning of a round is not binding on Player A s actual choice for M. Player A may move the 2

announced amount of water or more or less than the announced amount of water in any amount between 0 and 80 gallons of water, inclusive. In addition to M, there is a random, uncontrolled flow of water from Container 1 to Container 2, denoted by V. The computer program draws the value of V randomly from a uniform distribution over the interval [0, 40], which means that the minimum possible value of V is 0 and the maximum possible value of V is 40. All numbers between 0 and 40 inclusive have an equal chance of being drawn, so the expected value of V is 20. Player A does not know V when deciding how much water to move. The uncontrolled flow, V, is determined after all players made their decisions. It follows that: The final amount of water in Container 1 is: W 0 + af M V. The final amount of water in Container 2 is: M + V. Participants payoffs depend on the final amounts of water in Containers 1 and 2 as described in the next section. 2.2. Payoffs for the round If you are a Player A, the final amounts of water in both Containers 1 and 2 are used to determine your payoff in points for each round according to the formula: Player A Points = 6000 2 (Final Container 1 amount 120) 2 (Final Container 2 amount 40) 2 For your convenience, a non-exhaustive table of values for Player A s payoff in points is given in Table A as a function of the final water levels in Containers 1 and 2. Notice that Player As maximize their payoff when the final amount of water in Containers 1 and 2 are as close as possible to 120 and 40, respectively, and that deviations in the final Container 1 water amount from 120 are 2 times more costly than are deviations in the final Container 2 water amount from 40. If you are a Player B, only the final amount of water in Container 2 matters for your payoff in points. Specifically, your payoff in points for each round is given by the formula: Player B Points = 4000 (f Final Container 2 amount) 2 Recall that f denotes a Player B s own forecast for the round and not the average forecast, af. For your convenience, a non-exhaustive table of values for Player B s payoffs in points is given in Table B as a function of the difference, f Final Container 2 amount. Notice that Player Bs maximize their payoff when f = Final Container 2 water amount. 2.3. Feedback and record keeping at the end of each round. At the end of each round, Player A will be reminded of W 0, af and his or her choice of M. Player A will also be reminded of his or her message at the beginning of the round. Player A will then learn the value of the uncontrolled water flow from Container 1 to Container 2, V, and the final amount of water in Container 1 (W 0 + af M V) and in Container 2 (M + V). Finally, Player A will be told his or her own payoff in points for the round and their cumulative point total for the sequence. 3

At the end of each round, Player Bs will be reminded of their forecast, f, and learn the average forecast, af, by all Player Bs in their group (including themselves). Player Bs will also learn the value of W 0 (initial water in Container 1), and the sum, W 0 + af, which is the amount of water in Container 1 before Player A s choice of M. Player Bs will then learn the amount of water that Player A actually chose to move from Container 1 to Container 2, M. This amount can be compared with Player A s announcement at the beginning of the round about how much water he or she intended to move from Container 1 to Container 2. Further, Player Bs will learn the value of the uncontrolled water flow from Container 1 to Container 2, V, the final amount of water in Container 1 (W 0 + af M V), and the final amount of water in Container 2 (M + V). Finally, Player Bs will be told the difference between their forecast f, and the final amount of water in Container 2, their own payoff in points for the round and their cumulative point total for the sequence. Following revelation of this information, the round is over. Please record the results of the round on your record sheet under the appropriate headings. When you are done recording this information press the Continue button. The sequence may or may not continue with a new round, depending on the random number drawn. If a sequence continues, the procedures will be the same as above. Following the first round of a sequence, all players will see at the bottom of their screens, a history of past final amounts of water in Containers 1 and 2 for the five-person group they were in along with their own payoff in points for each round and their cumulative payoff in points from all rounds played in a given sequence. 3. When does a sequence of rounds continue and when does it end? At the end of each round, the computer program will randomly draw a number (an integer) between 1 and 6, inclusive. All numbers, 1,2,3,4, 5 and 6 have an equal chance of being drawn; it is like rolling a six-sided die. The number drawn will be displayed on your computer screen. If the number chosen is 1,2,3,4 or 5, the sequence will continue with a new round. If a 6 is chosen, the sequence will end. Thus, there is a 5 in 6 (83.33 percent) chance that a sequence will continue from one round to the next and a 1 in 6 (16.67 percent) chance that the current round will be the last round of the sequence. If a sequence ends, then, depending on the time available, a new sequence may then begin. At the start of each new sequence you would be randomly formed into new 5-member groups. One member of each group would be randomly chosen to play the role of Player A. The other four members would be assigned the role of Player B. These roles would again remain fixed for the duration of the new sequence. If, by chance, the final sequence has not ended by the three-hour time period for which you have been recruited, we will schedule a continuation of that final sequence for another time in which everyone here can attend. You would be paid based on your cumulative point total for one randomly selected sequence that finished in today s session and you would receive a further payment following completion of the final sequence in a continuation sequence, as discussed below. 4. Earnings If today s session ends within the 3-hour time period for which you have been recruited, then your payoff will depend on the total number of points you earned in a maximum of two of the sequences that were played in today s session. Specifically, if only one sequence was played, then your point total for today s session will equal your point total from that sequence. If two or more sequences have been played, then your point total for today s session will be the sum of your cumulative point totals from two sequences. If more than two sequences were played, then one sequence chosen for payment will be the sequence in 4

which you earned the highest payoff. The other sequence will be randomly chosen from among all sequences played in today s session. Your session point total from the chosen sequence(s) will be converted into dollars at the rate of 2000 points =$1.00 (or 20 points = 1 cent). Clearly, the more points you earn the higher is your dollar payoff. Since you don t know in advance which sequence(s) will determine your final payoff, you will want to do your best in every sequence. If, as mentioned above, the final sequence does not end within the 3 hour time period for today s session, then you would be paid for one randomly chosen sequence that did end during today s session (provided that event occurred) and following completion of the final sequence in the later, continuation session, you would also be paid for the sequence in which you earned the highest payoff. In addition to your dollar earnings from the two sequences chosen for payment, you begin each sequence with 5000 points ($2.50). The 5,000 initial endowment of points will show up in your cumulative point total for each sequence. Since we will pick two sequences for payment, these two initial point balances of 5,000 points (10,000 points total) comprise your $5.00 payment for your participation in today s session. If only one sequence is played in today s session then we will add another 5000 points to your cumulative point total for that one sequence. Note that your initial or cumulative point total in each sequence will be reduced if you earn negative points in any round, so you will want to carefully review Tables A and B. 5. Questions Now is the time for questions. If you have a question about any aspect of these instructions, please raise your hand and an experimenter will come to you and answer your question in private. 6. Quiz Before the start of the experiment we ask you to answer the following quiz questions in the spaces provided. The numbers in these quiz questions are merely illustrative; the actual numbers in the session may be quite different. In answering these questions, please feel free to consult the Instructions and Tables A and B. After all participants have completed this quiz we will come around to check your answers. 1. Suppose Player A observes that W 0 = 130 and af = 60 so that the new level of water in Container 1 is 190. Player A then chooses M = 70. Suppose it turns out that V = 25. What is the final amount of water in Container 2 in this case? What is the final amount of water in Container 1? What is Player A s payoff in points for the round? If a Player B forecasts f = 75, what would be that individual Player B s payoff for the round? 2. Same situation as in question 1, except that Player A chooses M = 40 instead of M = 70. What is the final amount of water in Container 2 in this case? What is the final amount of water in Container 1? What is Player A s payoff in points for the round? If a Player B forecasts f = 75, what would be that individual Player B s payoff for the round? 3. Suppose Player A observes that W 0.= 150 and af = 30 so the new level of water in Container 1 is 180. Player A then chooses M = 30. Suppose it turns out that V = 15. What is the final amount of water in Container 2 in this case? What is the final amount of water in Container 5

1? What is Player A s payoff in points for the round? If a Player B forecasts f = 35, what would be that individual Player B s payoff for the round? 4. Same situation as in question 3, except that Player A chooses M = 10 instead of M = 30. What is the final amount of water in Container 2 in this case? What is the final amount of water in Container 1? What is Player A s payoff in points for the round? If a Player B forecasts f = 35, what would be that individual Player B s payoff for the round? 5. Suppose it is round 2 of a sequence. What is the chance that the sequence will continue with round 3?. Would your answer change if we replaced round 2 with round 12 and round 3 with round 13? Circle one: yes / no. 6. True or false? You will remain in the same role as a Player A or Player B in all rounds of all sequences. Circle one: True / False. 7. True or false? Player A must move the amount of water that is announced in Player A s message sent to all 4 player Bs at the start of each round. Circle one: True / False 8. True or false? Player A can perfectly determine the final amount of water in Container 2 by his or her decision. Circle one: True / False 9. True or false? At the end of each round, all Player Bs will learn the amount of water, M, that their Player A chose to move from Container 1 to Container 2 and they can compare this amount with the amount of water that Player A announced s/he would move from Container 1 to Container 2 at the start of the round. Circle one: True / False 10. True or false? Both Player types A and B learn the final amounts of water in Containers 1 and 2 at the end of each round. Circle one: True / False 11. True or false? You will be paid based on the points you earned in a maximum of two sequences in today s session. Circle one: True / False. 6