Costly information providing in binary contests
Contests are commonly used as a mechanism for eliciting effort and participation in multi-agent settings. Naturally, and much like with various other mechanisms, the information provided to the agents prior to and throughout the contest fundamentally influences its outcomes. In this paper we study t...
Gespeichert in:
Veröffentlicht in: | Annals of mathematics and artificial intelligence 2024-10, Vol.92 (5), p.1353-1375 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1375 |
---|---|
container_issue | 5 |
container_start_page | 1353 |
container_title | Annals of mathematics and artificial intelligence |
container_volume | 92 |
creator | Simon, Noam Levy, Priel Sarne, David |
description | Contests are commonly used as a mechanism for eliciting effort and participation in multi-agent settings. Naturally, and much like with various other mechanisms, the information provided to the agents prior to and throughout the contest fundamentally influences its outcomes. In this paper we study the problem of information providing whenever the contest organizer does not initially hold the information and obtaining it is potentially costly. As the underlying contest mechanism for our model we use the binary contest, where contestants’ strategy is captured by their decision whether or not to participate in the contest in the first place. Here, it is often the case that the contest organizer can proactively obtain and provide contestants information related to their expected performance in the contest. We provide a comprehensive equilibrium analysis of the model, showing that even when such information is costless, it is not necessarily the case that the contest organizer will prefer to obtain and provide it to all agents, let alone when the information is costly. |
doi_str_mv | 10.1007/s10472-024-09953-7 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3116073860</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3116073860</sourcerecordid><originalsourceid>FETCH-LOGICAL-c270t-bc969702e7e987dbeaef9f9b7db5f99c35ea0a353430a0befbc9426f26c669e53</originalsourceid><addsrcrecordid>eNp9UMtKAzEUDaJgrf6AqwHXsTePSSZLGdQKBTe6DplpUqa0SU2mQv_eqyO4c3UPl_PiEHLL4J4B6EVhIDWnwCUFY2pB9RmZsVojkBrOEQPjlEspLslVKVsAMKpRM7JoUxl3p2qIIeW9G4cUq0NOn8N6iBv8Vt0QXT5VfYqjL2O5JhfB7Yq_-b1z8v70-NYu6er1-aV9WNGeaxhp1xtlNHCvvWn0uvPOBxNMh7AOxvSi9g6cqIUU4KDzAQWSq8BVr5TxtZiTu8kXy3wcMdlu0zFHjLSCMQVaNAqQxSdWn1Mp2Qd7yMMe-1oG9nsYOw1jcRj7M4zVKBKTqCA5bnz-s_5H9QW0lWYf</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3116073860</pqid></control><display><type>article</type><title>Costly information providing in binary contests</title><source>Springer Nature - Complete Springer Journals</source><creator>Simon, Noam ; Levy, Priel ; Sarne, David</creator><creatorcontrib>Simon, Noam ; Levy, Priel ; Sarne, David</creatorcontrib><description>Contests are commonly used as a mechanism for eliciting effort and participation in multi-agent settings. Naturally, and much like with various other mechanisms, the information provided to the agents prior to and throughout the contest fundamentally influences its outcomes. In this paper we study the problem of information providing whenever the contest organizer does not initially hold the information and obtaining it is potentially costly. As the underlying contest mechanism for our model we use the binary contest, where contestants’ strategy is captured by their decision whether or not to participate in the contest in the first place. Here, it is often the case that the contest organizer can proactively obtain and provide contestants information related to their expected performance in the contest. We provide a comprehensive equilibrium analysis of the model, showing that even when such information is costless, it is not necessarily the case that the contest organizer will prefer to obtain and provide it to all agents, let alone when the information is costly.</description><identifier>ISSN: 1012-2443</identifier><identifier>EISSN: 1573-7470</identifier><identifier>DOI: 10.1007/s10472-024-09953-7</identifier><language>eng</language><publisher>Cham: Springer International Publishing</publisher><subject>Artificial Intelligence ; Awards & honors ; Beauty contests ; Complex Systems ; Computer Science ; Cost analysis ; Equilibrium ; Equilibrium analysis ; Mathematics ; Multiagent systems ; Participation</subject><ispartof>Annals of mathematics and artificial intelligence, 2024-10, Vol.92 (5), p.1353-1375</ispartof><rights>The Author(s) 2024</rights><rights>The Author(s) 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c270t-bc969702e7e987dbeaef9f9b7db5f99c35ea0a353430a0befbc9426f26c669e53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10472-024-09953-7$$EPDF$$P50$$Gspringer$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10472-024-09953-7$$EHTML$$P50$$Gspringer$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Simon, Noam</creatorcontrib><creatorcontrib>Levy, Priel</creatorcontrib><creatorcontrib>Sarne, David</creatorcontrib><title>Costly information providing in binary contests</title><title>Annals of mathematics and artificial intelligence</title><addtitle>Ann Math Artif Intell</addtitle><description>Contests are commonly used as a mechanism for eliciting effort and participation in multi-agent settings. Naturally, and much like with various other mechanisms, the information provided to the agents prior to and throughout the contest fundamentally influences its outcomes. In this paper we study the problem of information providing whenever the contest organizer does not initially hold the information and obtaining it is potentially costly. As the underlying contest mechanism for our model we use the binary contest, where contestants’ strategy is captured by their decision whether or not to participate in the contest in the first place. Here, it is often the case that the contest organizer can proactively obtain and provide contestants information related to their expected performance in the contest. We provide a comprehensive equilibrium analysis of the model, showing that even when such information is costless, it is not necessarily the case that the contest organizer will prefer to obtain and provide it to all agents, let alone when the information is costly.</description><subject>Artificial Intelligence</subject><subject>Awards & honors</subject><subject>Beauty contests</subject><subject>Complex Systems</subject><subject>Computer Science</subject><subject>Cost analysis</subject><subject>Equilibrium</subject><subject>Equilibrium analysis</subject><subject>Mathematics</subject><subject>Multiagent systems</subject><subject>Participation</subject><issn>1012-2443</issn><issn>1573-7470</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>C6C</sourceid><recordid>eNp9UMtKAzEUDaJgrf6AqwHXsTePSSZLGdQKBTe6DplpUqa0SU2mQv_eqyO4c3UPl_PiEHLL4J4B6EVhIDWnwCUFY2pB9RmZsVojkBrOEQPjlEspLslVKVsAMKpRM7JoUxl3p2qIIeW9G4cUq0NOn8N6iBv8Vt0QXT5VfYqjL2O5JhfB7Yq_-b1z8v70-NYu6er1-aV9WNGeaxhp1xtlNHCvvWn0uvPOBxNMh7AOxvSi9g6cqIUU4KDzAQWSq8BVr5TxtZiTu8kXy3wcMdlu0zFHjLSCMQVaNAqQxSdWn1Mp2Qd7yMMe-1oG9nsYOw1jcRj7M4zVKBKTqCA5bnz-s_5H9QW0lWYf</recordid><startdate>20241001</startdate><enddate>20241001</enddate><creator>Simon, Noam</creator><creator>Levy, Priel</creator><creator>Sarne, David</creator><general>Springer International Publishing</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope></search><sort><creationdate>20241001</creationdate><title>Costly information providing in binary contests</title><author>Simon, Noam ; Levy, Priel ; Sarne, David</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c270t-bc969702e7e987dbeaef9f9b7db5f99c35ea0a353430a0befbc9426f26c669e53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Artificial Intelligence</topic><topic>Awards & honors</topic><topic>Beauty contests</topic><topic>Complex Systems</topic><topic>Computer Science</topic><topic>Cost analysis</topic><topic>Equilibrium</topic><topic>Equilibrium analysis</topic><topic>Mathematics</topic><topic>Multiagent systems</topic><topic>Participation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Simon, Noam</creatorcontrib><creatorcontrib>Levy, Priel</creatorcontrib><creatorcontrib>Sarne, David</creatorcontrib><collection>Springer Nature OA Free Journals</collection><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><jtitle>Annals of mathematics and artificial intelligence</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Simon, Noam</au><au>Levy, Priel</au><au>Sarne, David</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Costly information providing in binary contests</atitle><jtitle>Annals of mathematics and artificial intelligence</jtitle><stitle>Ann Math Artif Intell</stitle><date>2024-10-01</date><risdate>2024</risdate><volume>92</volume><issue>5</issue><spage>1353</spage><epage>1375</epage><pages>1353-1375</pages><issn>1012-2443</issn><eissn>1573-7470</eissn><abstract>Contests are commonly used as a mechanism for eliciting effort and participation in multi-agent settings. Naturally, and much like with various other mechanisms, the information provided to the agents prior to and throughout the contest fundamentally influences its outcomes. In this paper we study the problem of information providing whenever the contest organizer does not initially hold the information and obtaining it is potentially costly. As the underlying contest mechanism for our model we use the binary contest, where contestants’ strategy is captured by their decision whether or not to participate in the contest in the first place. Here, it is often the case that the contest organizer can proactively obtain and provide contestants information related to their expected performance in the contest. We provide a comprehensive equilibrium analysis of the model, showing that even when such information is costless, it is not necessarily the case that the contest organizer will prefer to obtain and provide it to all agents, let alone when the information is costly.</abstract><cop>Cham</cop><pub>Springer International Publishing</pub><doi>10.1007/s10472-024-09953-7</doi><tpages>23</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1012-2443 |
ispartof | Annals of mathematics and artificial intelligence, 2024-10, Vol.92 (5), p.1353-1375 |
issn | 1012-2443 1573-7470 |
language | eng |
recordid | cdi_proquest_journals_3116073860 |
source | Springer Nature - Complete Springer Journals |
subjects | Artificial Intelligence Awards & honors Beauty contests Complex Systems Computer Science Cost analysis Equilibrium Equilibrium analysis Mathematics Multiagent systems Participation |
title | Costly information providing in binary contests |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-21T18%3A21%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Costly%20information%20providing%20in%20binary%20contests&rft.jtitle=Annals%20of%20mathematics%20and%20artificial%20intelligence&rft.au=Simon,%20Noam&rft.date=2024-10-01&rft.volume=92&rft.issue=5&rft.spage=1353&rft.epage=1375&rft.pages=1353-1375&rft.issn=1012-2443&rft.eissn=1573-7470&rft_id=info:doi/10.1007/s10472-024-09953-7&rft_dat=%3Cproquest_cross%3E3116073860%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3116073860&rft_id=info:pmid/&rfr_iscdi=true |