TY - GEN
T1 - Exploiting puzzle diversity in puzzle selection for ESP-like GWAP systems
AU - Syu, Yu Song
AU - Yu, Hsiao Hsuan
AU - Chen, Ling Jyh
PY - 2010
Y1 - 2010
N2 - The ESP game belongs to the genre called Games with a Purpose (GWAP), which leverage people's desire to be entertained and also outsource certain steps of the computational process to humans. The productivity of ESP-like GWAP systems depends to a great extent on the puzzle selection strategy used in the system. Although traditional approaches seek to determine the optimal number of agreements reached in each puzzle, they may be affected by the equality of outcomes issue because they ignore the differences among puzzles. In this paper, using realistic game traces, we define the puzzle diversity issue and propose a novel approach, called the Adaptive Puzzle Selection Algorithm (APSA), to promote equality of opportunity in ESP-like GWAP systems. We also introduce a data structure called the Weight Sum Tree (WST) to reduce the computational complexity of the proposed scheme and facilitate its implementation in real-world systems. Using a comprehensive set of simulations, we evaluate the APSA scheme against the traditional OPSA scheme, and demonstrate that APSA can better accommodate the differences among puzzles in ESP-like GWAP systems.
AB - The ESP game belongs to the genre called Games with a Purpose (GWAP), which leverage people's desire to be entertained and also outsource certain steps of the computational process to humans. The productivity of ESP-like GWAP systems depends to a great extent on the puzzle selection strategy used in the system. Although traditional approaches seek to determine the optimal number of agreements reached in each puzzle, they may be affected by the equality of outcomes issue because they ignore the differences among puzzles. In this paper, using realistic game traces, we define the puzzle diversity issue and propose a novel approach, called the Adaptive Puzzle Selection Algorithm (APSA), to promote equality of opportunity in ESP-like GWAP systems. We also introduce a data structure called the Weight Sum Tree (WST) to reduce the computational complexity of the proposed scheme and facilitate its implementation in real-world systems. Using a comprehensive set of simulations, we evaluate the APSA scheme against the traditional OPSA scheme, and demonstrate that APSA can better accommodate the differences among puzzles in ESP-like GWAP systems.
UR - http://www.scopus.com/inward/record.url?scp=78649893448&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78649893448&partnerID=8YFLogxK
U2 - 10.1109/WI-IAT.2010.18
DO - 10.1109/WI-IAT.2010.18
M3 - Conference contribution
AN - SCOPUS:78649893448
SN - 9780769541914
T3 - Proceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2010
SP - 468
EP - 475
BT - 2010 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2010
T2 - 2010 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2010
Y2 - 31 August 2010 through 3 September 2010
ER -