TY - GEN
T1 - A game theoretic model of software crowdsourcing
AU - Hu, Zhenghui
AU - Wu, Wenjun
PY - 2014
Y1 - 2014
N2 - With the rapid development of crowdsourcing all over the world, crowdsourcing for software engineering begins to attract more and more considerable attentions from software developers, coders and researchers. And many successful online platforms such as TopCoder has demonstrated crowdsourcing's capability and potential for supporting various software development activities. In order to study the competitive behaviours for software crowdsourcing, we apply the famous game theory to model the 2-player algorithm challenges on TopCoder. And as all the participants are aware of other players' information and they make decisions almost simultaneously, this article adopts the theory of static games with complete information. Through Nash equilibria computing, we find that the value of successfully challenging probability can be used to deduce specific competitive decisions of coders in the algorithm challenge stage. Specifically, if a coder's probability to make a successful challenge exceeds some certain value, then he will always choose to challenge. The paper provides a new research perspective for software engineering crowdsourcing, and empirical research will be done in the next step of work.
AB - With the rapid development of crowdsourcing all over the world, crowdsourcing for software engineering begins to attract more and more considerable attentions from software developers, coders and researchers. And many successful online platforms such as TopCoder has demonstrated crowdsourcing's capability and potential for supporting various software development activities. In order to study the competitive behaviours for software crowdsourcing, we apply the famous game theory to model the 2-player algorithm challenges on TopCoder. And as all the participants are aware of other players' information and they make decisions almost simultaneously, this article adopts the theory of static games with complete information. Through Nash equilibria computing, we find that the value of successfully challenging probability can be used to deduce specific competitive decisions of coders in the algorithm challenge stage. Specifically, if a coder's probability to make a successful challenge exceeds some certain value, then he will always choose to challenge. The paper provides a new research perspective for software engineering crowdsourcing, and empirical research will be done in the next step of work.
UR - https://www.scopus.com/pages/publications/84903650405
U2 - 10.1109/SOSE.2014.79
DO - 10.1109/SOSE.2014.79
M3 - 会议稿件
AN - SCOPUS:84903650405
SN - 9781479925049
T3 - Proceedings - IEEE 8th International Symposium on Service Oriented System Engineering, SOSE 2014
SP - 446
EP - 453
BT - Proceedings - IEEE 8th International Symposium on Service Oriented System Engineering, SOSE 2014
PB - IEEE Computer Society
T2 - 8th IEEE International Symposium on Service Oriented System Engineering, SOSE 2014
Y2 - 7 April 2014 through 11 April 2014
ER -