Crowdsearch
A common economic process is crowdsearch, wherein a group of agents is invited to search for a valuable physical or virtual object, e.g. creating and patenting an invention, solving an open scientific problem, or identifying vulnerabilities in software. We study a binary model of crowdsearch in whic...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| 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 | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Gersbach, Hans Mamageishvili, Akaki Pitsuwan, Fikri |
| description | A common economic process is crowdsearch, wherein a group of agents is
invited to search for a valuable physical or virtual object, e.g. creating and
patenting an invention, solving an open scientific problem, or identifying
vulnerabilities in software. We study a binary model of crowdsearch in which
agents have different abilities to find the object. We characterize the types
of equilibria and identify which type of crowd maximizes the likelihood of
finding the object. Sometimes, however, an unlimited crowd is not sufficient to
guarantee that the object is found. It even can happen that inviting more
agents lowers the probability of finding the object. We characterize the
optimal prize and show that offering only one prize (winner-takes-all)
maximizes the probability of finding the object but is not necessarily optimal
for the crowdsearch designer. |
| doi_str_mv | 10.48550/arxiv.2311.08532 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2311_08532</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2311_08532</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-9e09fc2aa46fc2c552eb21ca4a04a1d05f5740fa93fb1a20ac28c9c32d157eb33</originalsourceid><addsrcrecordid>eNotzrsKwjAUgOEsDlJ9ACefoPXkJKdtRineoODSPZymCRYUJQUvb69Wp3_7-YRYSMh0SQQrjs_-nqGSMoOSFE5FUsXroxs8R3eaiUng8-Dn_yai2W6aap_Wx92hWtcp5wWmxoMJDpl1_okjQt-idKwZNMsOKFChIbBRoZWMwA5LZ5zCTlLhW6USsfxtR429xf7C8WW_Kjuq1BtnSTCR</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Crowdsearch</title><source>arXiv.org</source><creator>Gersbach, Hans ; Mamageishvili, Akaki ; Pitsuwan, Fikri</creator><creatorcontrib>Gersbach, Hans ; Mamageishvili, Akaki ; Pitsuwan, Fikri</creatorcontrib><description>A common economic process is crowdsearch, wherein a group of agents is
invited to search for a valuable physical or virtual object, e.g. creating and
patenting an invention, solving an open scientific problem, or identifying
vulnerabilities in software. We study a binary model of crowdsearch in which
agents have different abilities to find the object. We characterize the types
of equilibria and identify which type of crowd maximizes the likelihood of
finding the object. Sometimes, however, an unlimited crowd is not sufficient to
guarantee that the object is found. It even can happen that inviting more
agents lowers the probability of finding the object. We characterize the
optimal prize and show that offering only one prize (winner-takes-all)
maximizes the probability of finding the object but is not necessarily optimal
for the crowdsearch designer.</description><identifier>DOI: 10.48550/arxiv.2311.08532</identifier><language>eng</language><subject>Computer Science - Computer Science and Game Theory</subject><creationdate>2023-11</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2311.08532$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2311.08532$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Gersbach, Hans</creatorcontrib><creatorcontrib>Mamageishvili, Akaki</creatorcontrib><creatorcontrib>Pitsuwan, Fikri</creatorcontrib><title>Crowdsearch</title><description>A common economic process is crowdsearch, wherein a group of agents is
invited to search for a valuable physical or virtual object, e.g. creating and
patenting an invention, solving an open scientific problem, or identifying
vulnerabilities in software. We study a binary model of crowdsearch in which
agents have different abilities to find the object. We characterize the types
of equilibria and identify which type of crowd maximizes the likelihood of
finding the object. Sometimes, however, an unlimited crowd is not sufficient to
guarantee that the object is found. It even can happen that inviting more
agents lowers the probability of finding the object. We characterize the
optimal prize and show that offering only one prize (winner-takes-all)
maximizes the probability of finding the object but is not necessarily optimal
for the crowdsearch designer.</description><subject>Computer Science - Computer Science and Game Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsKwjAUgOEsDlJ9ACefoPXkJKdtRineoODSPZymCRYUJQUvb69Wp3_7-YRYSMh0SQQrjs_-nqGSMoOSFE5FUsXroxs8R3eaiUng8-Dn_yai2W6aap_Wx92hWtcp5wWmxoMJDpl1_okjQt-idKwZNMsOKFChIbBRoZWMwA5LZ5zCTlLhW6USsfxtR429xf7C8WW_Kjuq1BtnSTCR</recordid><startdate>20231114</startdate><enddate>20231114</enddate><creator>Gersbach, Hans</creator><creator>Mamageishvili, Akaki</creator><creator>Pitsuwan, Fikri</creator><scope>ADEOX</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20231114</creationdate><title>Crowdsearch</title><author>Gersbach, Hans ; Mamageishvili, Akaki ; Pitsuwan, Fikri</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-9e09fc2aa46fc2c552eb21ca4a04a1d05f5740fa93fb1a20ac28c9c32d157eb33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Computer Science and Game Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Gersbach, Hans</creatorcontrib><creatorcontrib>Mamageishvili, Akaki</creatorcontrib><creatorcontrib>Pitsuwan, Fikri</creatorcontrib><collection>arXiv Economics</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gersbach, Hans</au><au>Mamageishvili, Akaki</au><au>Pitsuwan, Fikri</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Crowdsearch</atitle><date>2023-11-14</date><risdate>2023</risdate><abstract>A common economic process is crowdsearch, wherein a group of agents is
invited to search for a valuable physical or virtual object, e.g. creating and
patenting an invention, solving an open scientific problem, or identifying
vulnerabilities in software. We study a binary model of crowdsearch in which
agents have different abilities to find the object. We characterize the types
of equilibria and identify which type of crowd maximizes the likelihood of
finding the object. Sometimes, however, an unlimited crowd is not sufficient to
guarantee that the object is found. It even can happen that inviting more
agents lowers the probability of finding the object. We characterize the
optimal prize and show that offering only one prize (winner-takes-all)
maximizes the probability of finding the object but is not necessarily optimal
for the crowdsearch designer.</abstract><doi>10.48550/arxiv.2311.08532</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2311.08532 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2311_08532 |
| source | arXiv.org |
| subjects | Computer Science - Computer Science and Game Theory |
| title | Crowdsearch |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T02%3A04%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Crowdsearch&rft.au=Gersbach,%20Hans&rft.date=2023-11-14&rft_id=info:doi/10.48550/arxiv.2311.08532&rft_dat=%3Carxiv_GOX%3E2311_08532%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |