text stringlengths 304 431k | study stringclasses 149
values | experiment stringclasses 264
values | participant stringlengths 1 42 | is_psych101 bool 2
classes | is_psych101_test bool 2
classes | RTs listlengths 1 5.26k | gender stringclasses 4
values | age stringlengths 3 16 | nationality stringclasses 156
values | education stringclasses 10
values | clinical diagnosis stringclasses 5
values | STICSA-T somatic stringclasses 43
values | STICSA-T cognitive stringclasses 42
values | STAI-S stringclasses 59
values | STAI-T stringclasses 62
values | IUS stringclasses 44
values | RRQ stringclasses 40
values | AUDIT stringclasses 38
values | DAST stringclasses 12
values | PSWQ stringclasses 58
values | GAD-7 stringclasses 23
values | SDS stringclasses 54
values | OCI stringclasses 63
values | PHQ-9 stringclasses 21
values | PHQ-8 stringclasses 25
values | BAS Drive stringclasses 11
values | BAS Fun Seeking stringclasses 10
values | BAS Reward Responsiveness stringclasses 10
values | BDI-II stringclasses 56
values | BIS-11 stringclasses 34
values | BIS-10 stringclasses 64
values | participant_reindexed stringlengths 1 5 | in_eval bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
You are presented with a series of dilemmas in which an autonomous vehicle must decide between two different outcomes.
Your task is to decide what the self-driving car should do.
You can select your chosen outcome by pressing the corresponding button.
Outcome B: In this case, the self-driving car with a sudden brake f... | awad2018moral | awad2018moral/SharedResponses.csv | ['1033769605_9763045718887258.0'] | false | false | [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
] | N/A | N/A | United States | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 33099 | false |
In this task, you have to repeatedly choose between two options labeled J and L.
You can choose an option by pressing its corresponding key.
Each option would hypothetically lead to you earning a specified amount of money in a specified amount of time.
Option J: 1500.0 dollars in 8.0 days.
Option L: 1500.0 dollars min... | agrawal2024stress | agrawal2024stress/nov2020_covid_problems.csv | 1140 | false | false | [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null... | male | 45.0 | N/A | Bachelor's Degree | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 9060 | false |
You are taking part in a game in which you have to repeatedly choose between two options.
You can select an option by pressing the corresponding key.
There is always one safe option with a guaranteed outcome and one risky option with two possible outcomes.
Your goal is to accumulate as many points as possible.
In betwe... | rutledge2023happiness | rutledge2023happiness/subjData | 20654 | false | false | [
4399,
5119,
2237,
1959,
6229,
2776,
2942,
1744,
5102,
4221,
1728,
1892,
5550,
3241,
2108,
4235,
4672,
1892,
1893,
6402,
3238,
4088,
2241,
1411,
4767,
2394,
2546,
3159,
1991,
2241,
4154,
2327,
2710,
2107,
4804,
2110,
3440,
5084,
1678,
1797... | male | N/A | N/A | Technical Education | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 48921 | false |
In this task, you will be presented with 4 stimuli, A, B, C, and D. Once the stimulus is presented, you must decide whether to press a button or not.
Each stimulus is associated with two possible outcomes, and your reward depends on whether you decide to press the button or not.
For two of the stimuli, choosing correct... | moutoussis2018pavlovian | moutoussis2018pavlovian | 34520 | false | false | [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null... | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 816 | false |
You are taking part in a game in which you have to repeatedly choose between two options.
You can select an option by pressing the corresponding key.
There is always one safe option with a guaranteed outcome and one risky option with two possible outcomes.
Your goal is to accumulate as many points as possible.
In betwe... | rutledge2023happiness | rutledge2023happiness/subjData | 33194 | false | false | [
9698,
12918,
7811,
9748,
9907,
3271,
9900,
7491,
4362,
5968,
3662,
9748,
9799,
4815,
5083,
13527,
9342,
5950,
4073.0000000000005,
12866,
5307,
2814,
2472,
4797,
8460,
4712,
2474,
3966,
8765,
2154,
4661,
2577,
4765,
2390,
9373,
4578,
2797,
225... | male | N/A | United States | Master's Degree or Higher | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 48922 | false |
You see in front of you four decks of cards labeled G, V, K, and F.
You get a loan of 2000$ of play money.
You have to select one card at a time, from any of the four decks, for 100 trials.
You select a card from a deck by pressing the corresponding key.
After turning a card, you win some money, the amount varies with ... | steingroever2015data | steingroever2015data/exp1.csv | 173 | true | true | [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null... | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 65 | false |
You will encounter a series of gambling problems where you have to select between two options.
You can select an option by pressing the corresponding key.
For some problems, you are told the points you received and missed out on after each selection, while for others this information is suppressed.
In cases where the p... | peterson2021using | peterson2021using/exp1.csv | 4083 | true | false | [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null... | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 13734 | false |
You are taking part in a game in which you have to repeatedly choose between two options.
You can select an option by pressing the corresponding key.
There is always one safe option with a guaranteed outcome and one risky option with two possible outcomes.
Your goal is to accumulate as many points as possible.
In betwe... | rutledge2023happiness | rutledge2023happiness/subjData | 43254 | false | false | [
15623,
5183,
4420,
1925,
6262,
6227,
2896,
1357,
5091,
5505,
1390,
5071,
6528,
3582,
3114,
4972,
2193,
1508,
1725,
6243,
2327,
1355,
1742,
4854,
2865,
1408,
1325,
5556,
1793,
1357,
4200,
1263,
1640,
2112,
3130,
1392,
3753,
1824,
5459,
702... | male | N/A | N/A | Technical Education | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 48923 | false |
In the following you will be presented with multiple choices between two options C and G.
Please name which option you would prefer by pressing the corresponding key.
You have the choice between receiving 500$ immediately (press C) or receiving 550$ in one year (press G). You press <<G>>.
You have the choice between r... | ruggeri2022globalizability | ruggeri2022globalizability/exp1.csv | 10214 | true | false | [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
] | male | 30.0 | Belgium | High School | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 11933 | false |
In this task you'll see two buttons on your screen. Each button has some probability of paying out a certain number of points and zero points otherwise. Your task in each block is to decide which button you prefer to be paid out from.
Before deciding, you can sample from each button by clicking on it to reveal what it... | anvari2024sampling_paradigm | anvari2024sampling_paradigm/ | qjgv7cbg | false | false | [
null,
17915.99988937378,
10934.000015258787,
null,
null,
3369.999885559082,
null,
null,
1777.9998779296875,
1833.0001831054688,
1774.9998569488523,
null,
null,
1657.0000648498535,
2338.0000591278076,
1375.999927520752,
null,
null,
1658.9999198913574,
null,
null,
1121.999979... | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 920 | false |
In the following you will be presented with multiple choices between two options O and J.
Please name which option you would prefer by pressing the corresponding key.
You have the choice between receiving 500$ immediately (press O) or receiving 550$ in one year (press J). You press <<O>>.
You have the choice between r... | ruggeri2022globalizability | ruggeri2022globalizability/exp1.csv | 2642 | true | false | [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
] | male | 23.0 | South Africa | Bachelor's Degree | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 11934 | false |
You will be selecting one of the fractals A or X. These fractals will take you to one of blue or orange state.
The fractals can take you to either state, but one will mostly take you to the blue state, and the other will mostly take you to the orange state.
The state a fractal takes you to most won't change during the... | gillan2016characterizing | gillan2016characterizing/exp2.csv | 3XIQGXAUMC8I6RNNN0MSWEGUYSBX7I | false | false | [
808,
893,
626,
365,
270,
700,
260,
617,
588,
1019,
408,
652,
321,
516,
280,
435,
464,
347,
377,
284,
405,
316,
319,
331,
481,
283,
330,
229,
264,
243,
169,
364,
288,
485,
335,
299,
319,
267,
256,
315,
359,
252,
303,
500,
249,
... | N/A | 28.0 | N/A | N/A | N/A | N/A | N/A | N/A | 49 | N/A | N/A | 5 | N/A | N/A | N/A | 54 | 18 | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 72 | 2359 | false |
You are presented with a series of dilemmas in which an autonomous vehicle must decide between two different outcomes.
Your task is to decide what the self-driving car should do.
You can select your chosen outcome by pressing the corresponding button.
Outcome I: In this case, the self-driving car with a sudden brake f... | awad2018moral | awad2018moral/SharedResponses.csv | ['-1230342877_4541447431352235.0'] | false | false | [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
] | N/A | N/A | Russia | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 33100 | false |
In this task, you have to repeatedly choose between two options labeled O and X.
You can choose an option by pressing its corresponding key.
Each option would hypothetically lead to you earning a specified amount of money in a specified amount of time.
Option O: 40.0 dollars in 4.0 days.
Option X: 40.0 dollars plus 2.... | agrawal2024stress | agrawal2024stress/june2020_covid_problems.csv | 2930 | false | false | [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null... | female | 43.0 | N/A | Bachelor's Degree | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 9061 | false |
In the following you will be presented with multiple choices between two options T and Q.
Please name which option you would prefer by pressing the corresponding key.
You have the choice between receiving 500$ immediately (press T) or receiving 550$ in one year (press Q). You press <<Q>>.
You have the choice between r... | ruggeri2022globalizability | ruggeri2022globalizability/exp1.csv | 5362 | true | false | [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
] | female | 34.0 | New Zealand | Bachelor's Degree | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 11935 | false |
In the following you will be presented with multiple choices between two options P and J.
Please name which option you would prefer by pressing the corresponding key.
You have the choice between receiving 500$ immediately (press P) or receiving 550$ in one year (press J). You press <<P>>.
You have the choice between r... | ruggeri2022globalizability | ruggeri2022globalizability/exp1.csv | 7192 | true | false | [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
] | male | 37.0 | New Zealand | Technical Education | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 11936 | false |
In this task, five buttons will be displayed on the screen, and on each trial you have to select one of the five buttons by clicking on it. Each time you select a button, you earn some points. Buttons differ from one another in the average points that they yield. There will be 20 trials in the practice block and 40 in ... | anvari2024armed_bandit | anvari2024armed_bandit/ | cvee73hc | false | false | [
7340.211391448975,
1987.99991607666,
742.0001029968262,
359.9998950958252,
713.0000591278076,
3141.9999599456787,
901.0000228881836,
390.0001049041748,
202.9998302459716,
299.9999523162842,
293.0002212524414,
299.9999523162842,
485.9998226165771,
421.0000038146972,
300.0001907348633,
3... | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 924 | false |
You are presented with a series of dilemmas in which an autonomous vehicle must decide between two different outcomes.
Your task is to decide what the self-driving car should do.
You can select your chosen outcome by pressing the corresponding button.
Outcome E: In this case, the self-driving car with a sudden brake f... | awad2018moral | awad2018moral/SharedResponses.csv | ['-790375311_5939921269431561.0'] | false | false | [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null
] | N/A | N/A | Sweden | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 33101 | false |
You are taking part in a game in which you have to repeatedly choose between two options.
You can select an option by pressing the corresponding key.
There is always one safe option with a guaranteed outcome and one risky option with two possible outcomes.
Your goal is to accumulate as many points as possible.
In betwe... | rutledge2023happiness | rutledge2023happiness/subjData | 3754 | false | false | [
4405,
10679,
3597,
6882,
4786,
5512,
2904,
8236,
5033,
12668,
4025.0000000000005,
4094.0000000000005,
6800,
2622,
2853,
3448,
3662,
4993,
2343,
3001,
3265,
3742,
9580,
2937,
4217,
3874,
4881,
2604,
5193,
4138,
4024,
4843,
4945,
5819,
3032,
4699,
... | female | N/A | United Kingdom | Master's Degree or Higher | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 48924 | false |
Throughout the task, you will be presented with balloons, one at a time.
In each step, you can choose to pump up the balloon by pressing K and you will accumulate 1 point for each pump.
At any point, you can stop pumping up the balloon by pressing N and you will collect your accumulated points.
You will repeat this pro... | frey2017risk | frey2017risk/exp1.csv | 520 | true | false | [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null... | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 1330 | false |
You will be given three numbers (N1, N2, N3). Your task is to make a binary selection by pressing a corresponding key to judge whether the subtraction between the first two numbers is divisible by the third number.
During each trial, you will answer a new question, where you may or may not receive a visual feedback to ... | xu2023augmenting | xu2023augmenting/../../../exp1.csv | 12 | false | false | [
7071.319103240967,
7234.185934066772,
3154.223918914795,
5009.335994720459,
3935.9521865844727,
2078.428268432617,
2462.602138519287,
2385.9200477600098,
5246.37508392334,
5161.226987838745,
4011.234998703003,
7934.33690071106,
6982.495069503784,
2331.042051315308,
6734.977960586548,
6... | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | N/A | 78 | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.