Incentive Mechanism for Mobile Crowdsourcing Using an Optimized Tournament Model

With the wide adoption of smart mobile devices, there is a rapid development of location-based services. One key feature of supporting a pleasant/excellent service is the access to adequate and comprehensive data, which can be obtained by mobile crowdsourcing. The main challenge in crowdsourcing is...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE journal on selected areas in communications 2017-04, Vol.35 (4), p.880-892
Hauptverfasser: Yanru Zhang, Chunxiao Jiang, Lingyang Song, Miao Pan, Dawy, Zaher, Zhu Han
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 892
container_issue 4
container_start_page 880
container_title IEEE journal on selected areas in communications
container_volume 35
creator Yanru Zhang
Chunxiao Jiang
Lingyang Song
Miao Pan
Dawy, Zaher
Zhu Han
description With the wide adoption of smart mobile devices, there is a rapid development of location-based services. One key feature of supporting a pleasant/excellent service is the access to adequate and comprehensive data, which can be obtained by mobile crowdsourcing. The main challenge in crowdsourcing is how the service provider (principal) incentivizes a large group of mobile users to participate. In this paper, we investigate the problem of designing a crowdsourcing tournament to maximize the principal's utility in crowdsourcing and provide continuous incentives for users by rewarding them based on the rank achieved. First, we model the user's utility of reward from achieving one of the winning ranks in the tournament. Then, the utility maximization problem of the principal is formulated, under the constraint that the user maximizes its own utility by choosing the optimal effort in the crowdsourcing tournament. Finally, we present numerical results to show the parameters' impact on the tournament design and compare the system performance under the different proposed incentive mechanisms. We show that by using the tournament, the principal successfully maximizes the utilities, and users obtain the continuous incentives to participate in the crowdsourcing activity.
doi_str_mv 10.1109/JSAC.2017.2680798
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1902275155</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7875128</ieee_id><sourcerecordid>1902275155</sourcerecordid><originalsourceid>FETCH-LOGICAL-c384t-4e438d79dd236a8bb35a1d94ca36fce10437859048a4f4d498ec969c5709ac313</originalsourceid><addsrcrecordid>eNo9kEtPwzAQhC0EEqXwAxCXSJxT1o_E9rGKeBS1KhLt2XJtB1zlUewUBL-ehFZcdg87M9r5ELrGMMEY5N3z67SYEMB8QnIBXIoTNMJZJlIAEKdoBJzSVHCcn6OLGLcAmDFBRuhl1hjXdP7TJQtn3nXjY52UbUgW7cZXLilC-2Vjuw_GN2_JOg5TN8ly1_na_zibrPpbo-s-o7dYV12is1JX0V0d9xitH-5XxVM6Xz7Oiuk8NVSwLmWOUWG5tJbQXIvNhmYaW8mMpnlpHAZGucgkMKFZySyTwhmZS5NxkNpQTMfo9pC7C-3H3sVObf8-qaLCEgjhWV-_V-GDyoQ2xuBKtQu-1uFbYVADODWAUwM4dQTXe24OHu-c-9dz0ScSQX8BIR9pSQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1902275155</pqid></control><display><type>article</type><title>Incentive Mechanism for Mobile Crowdsourcing Using an Optimized Tournament Model</title><source>IEEE Electronic Library (IEL)</source><creator>Yanru Zhang ; Chunxiao Jiang ; Lingyang Song ; Miao Pan ; Dawy, Zaher ; Zhu Han</creator><creatorcontrib>Yanru Zhang ; Chunxiao Jiang ; Lingyang Song ; Miao Pan ; Dawy, Zaher ; Zhu Han</creatorcontrib><description>With the wide adoption of smart mobile devices, there is a rapid development of location-based services. One key feature of supporting a pleasant/excellent service is the access to adequate and comprehensive data, which can be obtained by mobile crowdsourcing. The main challenge in crowdsourcing is how the service provider (principal) incentivizes a large group of mobile users to participate. In this paper, we investigate the problem of designing a crowdsourcing tournament to maximize the principal's utility in crowdsourcing and provide continuous incentives for users by rewarding them based on the rank achieved. First, we model the user's utility of reward from achieving one of the winning ranks in the tournament. Then, the utility maximization problem of the principal is formulated, under the constraint that the user maximizes its own utility by choosing the optimal effort in the crowdsourcing tournament. Finally, we present numerical results to show the parameters' impact on the tournament design and compare the system performance under the different proposed incentive mechanisms. We show that by using the tournament, the principal successfully maximizes the utilities, and users obtain the continuous incentives to participate in the crowdsourcing activity.</description><identifier>ISSN: 0733-8716</identifier><identifier>EISSN: 1558-0008</identifier><identifier>DOI: 10.1109/JSAC.2017.2680798</identifier><identifier>CODEN: ISACEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>contract theory ; Contracts ; Crowdsourcing ; Electric shock ; Electronic devices ; Electronic mail ; incentive mechanism ; Incentives ; Location based services ; Mathematical models ; Measurement errors ; Mobile communication ; Mobile crowdsourcing ; moral hazard ; Numerical models ; Optimization ; tournament ; Utilities</subject><ispartof>IEEE journal on selected areas in communications, 2017-04, Vol.35 (4), p.880-892</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c384t-4e438d79dd236a8bb35a1d94ca36fce10437859048a4f4d498ec969c5709ac313</citedby><cites>FETCH-LOGICAL-c384t-4e438d79dd236a8bb35a1d94ca36fce10437859048a4f4d498ec969c5709ac313</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7875128$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7875128$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yanru Zhang</creatorcontrib><creatorcontrib>Chunxiao Jiang</creatorcontrib><creatorcontrib>Lingyang Song</creatorcontrib><creatorcontrib>Miao Pan</creatorcontrib><creatorcontrib>Dawy, Zaher</creatorcontrib><creatorcontrib>Zhu Han</creatorcontrib><title>Incentive Mechanism for Mobile Crowdsourcing Using an Optimized Tournament Model</title><title>IEEE journal on selected areas in communications</title><addtitle>J-SAC</addtitle><description>With the wide adoption of smart mobile devices, there is a rapid development of location-based services. One key feature of supporting a pleasant/excellent service is the access to adequate and comprehensive data, which can be obtained by mobile crowdsourcing. The main challenge in crowdsourcing is how the service provider (principal) incentivizes a large group of mobile users to participate. In this paper, we investigate the problem of designing a crowdsourcing tournament to maximize the principal's utility in crowdsourcing and provide continuous incentives for users by rewarding them based on the rank achieved. First, we model the user's utility of reward from achieving one of the winning ranks in the tournament. Then, the utility maximization problem of the principal is formulated, under the constraint that the user maximizes its own utility by choosing the optimal effort in the crowdsourcing tournament. Finally, we present numerical results to show the parameters' impact on the tournament design and compare the system performance under the different proposed incentive mechanisms. We show that by using the tournament, the principal successfully maximizes the utilities, and users obtain the continuous incentives to participate in the crowdsourcing activity.</description><subject>contract theory</subject><subject>Contracts</subject><subject>Crowdsourcing</subject><subject>Electric shock</subject><subject>Electronic devices</subject><subject>Electronic mail</subject><subject>incentive mechanism</subject><subject>Incentives</subject><subject>Location based services</subject><subject>Mathematical models</subject><subject>Measurement errors</subject><subject>Mobile communication</subject><subject>Mobile crowdsourcing</subject><subject>moral hazard</subject><subject>Numerical models</subject><subject>Optimization</subject><subject>tournament</subject><subject>Utilities</subject><issn>0733-8716</issn><issn>1558-0008</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kEtPwzAQhC0EEqXwAxCXSJxT1o_E9rGKeBS1KhLt2XJtB1zlUewUBL-ehFZcdg87M9r5ELrGMMEY5N3z67SYEMB8QnIBXIoTNMJZJlIAEKdoBJzSVHCcn6OLGLcAmDFBRuhl1hjXdP7TJQtn3nXjY52UbUgW7cZXLilC-2Vjuw_GN2_JOg5TN8ly1_na_zibrPpbo-s-o7dYV12is1JX0V0d9xitH-5XxVM6Xz7Oiuk8NVSwLmWOUWG5tJbQXIvNhmYaW8mMpnlpHAZGucgkMKFZySyTwhmZS5NxkNpQTMfo9pC7C-3H3sVObf8-qaLCEgjhWV-_V-GDyoQ2xuBKtQu-1uFbYVADODWAUwM4dQTXe24OHu-c-9dz0ScSQX8BIR9pSQ</recordid><startdate>20170401</startdate><enddate>20170401</enddate><creator>Yanru Zhang</creator><creator>Chunxiao Jiang</creator><creator>Lingyang Song</creator><creator>Miao Pan</creator><creator>Dawy, Zaher</creator><creator>Zhu Han</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope></search><sort><creationdate>20170401</creationdate><title>Incentive Mechanism for Mobile Crowdsourcing Using an Optimized Tournament Model</title><author>Yanru Zhang ; Chunxiao Jiang ; Lingyang Song ; Miao Pan ; Dawy, Zaher ; Zhu Han</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c384t-4e438d79dd236a8bb35a1d94ca36fce10437859048a4f4d498ec969c5709ac313</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>contract theory</topic><topic>Contracts</topic><topic>Crowdsourcing</topic><topic>Electric shock</topic><topic>Electronic devices</topic><topic>Electronic mail</topic><topic>incentive mechanism</topic><topic>Incentives</topic><topic>Location based services</topic><topic>Mathematical models</topic><topic>Measurement errors</topic><topic>Mobile communication</topic><topic>Mobile crowdsourcing</topic><topic>moral hazard</topic><topic>Numerical models</topic><topic>Optimization</topic><topic>tournament</topic><topic>Utilities</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yanru Zhang</creatorcontrib><creatorcontrib>Chunxiao Jiang</creatorcontrib><creatorcontrib>Lingyang Song</creatorcontrib><creatorcontrib>Miao Pan</creatorcontrib><creatorcontrib>Dawy, Zaher</creatorcontrib><creatorcontrib>Zhu Han</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE journal on selected areas in communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yanru Zhang</au><au>Chunxiao Jiang</au><au>Lingyang Song</au><au>Miao Pan</au><au>Dawy, Zaher</au><au>Zhu Han</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Incentive Mechanism for Mobile Crowdsourcing Using an Optimized Tournament Model</atitle><jtitle>IEEE journal on selected areas in communications</jtitle><stitle>J-SAC</stitle><date>2017-04-01</date><risdate>2017</risdate><volume>35</volume><issue>4</issue><spage>880</spage><epage>892</epage><pages>880-892</pages><issn>0733-8716</issn><eissn>1558-0008</eissn><coden>ISACEM</coden><abstract>With the wide adoption of smart mobile devices, there is a rapid development of location-based services. One key feature of supporting a pleasant/excellent service is the access to adequate and comprehensive data, which can be obtained by mobile crowdsourcing. The main challenge in crowdsourcing is how the service provider (principal) incentivizes a large group of mobile users to participate. In this paper, we investigate the problem of designing a crowdsourcing tournament to maximize the principal's utility in crowdsourcing and provide continuous incentives for users by rewarding them based on the rank achieved. First, we model the user's utility of reward from achieving one of the winning ranks in the tournament. Then, the utility maximization problem of the principal is formulated, under the constraint that the user maximizes its own utility by choosing the optimal effort in the crowdsourcing tournament. Finally, we present numerical results to show the parameters' impact on the tournament design and compare the system performance under the different proposed incentive mechanisms. We show that by using the tournament, the principal successfully maximizes the utilities, and users obtain the continuous incentives to participate in the crowdsourcing activity.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/JSAC.2017.2680798</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0733-8716
ispartof IEEE journal on selected areas in communications, 2017-04, Vol.35 (4), p.880-892
issn 0733-8716
1558-0008
language eng
recordid cdi_proquest_journals_1902275155
source IEEE Electronic Library (IEL)
subjects contract theory
Contracts
Crowdsourcing
Electric shock
Electronic devices
Electronic mail
incentive mechanism
Incentives
Location based services
Mathematical models
Measurement errors
Mobile communication
Mobile crowdsourcing
moral hazard
Numerical models
Optimization
tournament
Utilities
title Incentive Mechanism for Mobile Crowdsourcing Using an Optimized Tournament Model
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T17%3A24%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Incentive%20Mechanism%20for%20Mobile%20Crowdsourcing%20Using%20an%20Optimized%20Tournament%20Model&rft.jtitle=IEEE%20journal%20on%20selected%20areas%20in%20communications&rft.au=Yanru%20Zhang&rft.date=2017-04-01&rft.volume=35&rft.issue=4&rft.spage=880&rft.epage=892&rft.pages=880-892&rft.issn=0733-8716&rft.eissn=1558-0008&rft.coden=ISACEM&rft_id=info:doi/10.1109/JSAC.2017.2680798&rft_dat=%3Cproquest_RIE%3E1902275155%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1902275155&rft_id=info:pmid/&rft_ieee_id=7875128&rfr_iscdi=true