Mechanical Turk Puzzle (00025)

The Mechanical Turk Dots datasets come from Andrew Mao and were collected using Mechanical Turk. These data sets each contain elections with 793-797 voters over 4 candidates.

Each of the candidates correspond to an instance of the sliding puzzle game presented to a user on Mechanical Turk, who is asked to rank the items from those in a position closest to solution (first) to those requiring the most moves to complete (last). Thus, for all of these data sets there is a ground truth ranking which corresponds to the candidate names in sorted order. In the Puzzle task, each task contains elements requiring d, d+3, d+6, and d+9 moves to complete, where d = {5, 7, 9, 11}. This allows for more noise to be introduced to various iterations of the task. For each i, 40 sets of puzzles were placed on Mechanical Turk and were ranked by 20 users. As per the data owners request these 160 individual trails have been aggregated into a single file for each i. The individual trial runs are available upon request.

Required citations: Andrew Mao, Ariel D. Procaccia, and Yiling Chen. Better Human Computation Through Principled Voting. In proceedings of the Twenty-Seventh Conference on Artificial Intelligence (AAAI), 2013.

Download the dataset [zip, 2.7 KB]

Details

  • Number of files: 4
  • Total size: 2.6 KB
  • Data types: soc.
  • Publication date: July 9, 2014
  • Last modification: Sept. 22, 2022
all_11_14_17_20 — 00025-00000001.soc
793 Voters, 4 Alternatives
all_5_8_11_14 — 00025-00000002.soc
795 Voters, 4 Alternatives
all_7_10_13_16 — 00025-00000003.soc
795 Voters, 4 Alternatives
all_9_12_15_18 — 00025-00000004.soc
797 Voters, 4 Alternatives