解决np难题的严肃游戏:挑战和见解

2016 IEEE/ACM 5th International Workshop on Games and Software Engineering (GAS) Pub Date : 2016-05-14 DOI:10.1145/2896958.2896963

Christina Chung, Asako Matsuoka, Yueti Yang, J. Rubin, M. Chechik

{"title":"解决np难题的严肃游戏:挑战和见解","authors":"Christina Chung, Asako Matsuoka, Yueti Yang, J. Rubin, M. Chechik","doi":"10.1145/2896958.2896963","DOIUrl":null,"url":null,"abstract":"This paper describes the on-going work of developing a serious game (a.k.a “game with a purpose”) to solve the NP-hard problem of n-way merging. We outline the challenges that were encountered while designing the game, steps that we took to overcome these challenges and results of the preliminary evaluation of our current game design. We hope our experience will be useful for those developing serious games to solve other computationally expensive problems.","PeriodicalId":339009,"journal":{"name":"2016 IEEE/ACM 5th International Workshop on Games and Software Engineering (GAS)","volume":"385 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Serious Games for NP-hard Problems: Challenges and Insights\",\"authors\":\"Christina Chung, Asako Matsuoka, Yueti Yang, J. Rubin, M. Chechik\",\"doi\":\"10.1145/2896958.2896963\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes the on-going work of developing a serious game (a.k.a “game with a purpose”) to solve the NP-hard problem of n-way merging. We outline the challenges that were encountered while designing the game, steps that we took to overcome these challenges and results of the preliminary evaluation of our current game design. We hope our experience will be useful for those developing serious games to solve other computationally expensive problems.\",\"PeriodicalId\":339009,\"journal\":{\"name\":\"2016 IEEE/ACM 5th International Workshop on Games and Software Engineering (GAS)\",\"volume\":\"385 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE/ACM 5th International Workshop on Games and Software Engineering (GAS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2896958.2896963\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE/ACM 5th International Workshop on Games and Software Engineering (GAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2896958.2896963","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

本文描述了正在进行的开发一个严肃博弈(又名“有目的博弈”)来解决n-way合并的np困难问题的工作。我们概述了在设计游戏时遇到的挑战，克服这些挑战的步骤，以及对当前游戏设计的初步评估结果。我们希望我们的经验能够帮助那些开发严肃游戏的人解决其他昂贵的计算问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Serious Games for NP-hard Problems: Challenges and Insights

This paper describes the on-going work of developing a serious game (a.k.a “game with a purpose”) to solve the NP-hard problem of n-way merging. We outline the challenges that were encountered while designing the game, steps that we took to overcome these challenges and results of the preliminary evaluation of our current game design. We hope our experience will be useful for those developing serious games to solve other computationally expensive problems.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 IEEE/ACM 5th International Workshop on Games and Software Engineering (GAS)

自引率

0.00%

发文量