Regret-Minimizing Project Choice
An agent observes the set of available projects and proposes some, but not necessarily all, of them. A principal chooses one or none from the proposed set. We solve for a mechanism that minimizes the principal's worst-case regret. We compare the single-project environment in which the agent can...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| 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 | Guo, Yingni Shmaya, Eran |
| description | An agent observes the set of available projects and proposes some, but not
necessarily all, of them. A principal chooses one or none from the proposed
set. We solve for a mechanism that minimizes the principal's worst-case regret.
We compare the single-project environment in which the agent can propose only
one project with the multiproject environment in which he can propose many. In
both environments, if the agent proposes one project, it is chosen for sure if
the principal's payoff is sufficiently high; otherwise, the probability that it
is chosen decreases in the agent's payoff. In the multiproject environment, the
agent's payoff from proposing multiple projects equals his maximal payoff from
proposing each project alone. The multiproject environment outperforms the
single-project one by providing better fallback options than rejection and by
delivering this payoff to the agent more efficiently. |
| doi_str_mv | 10.48550/arxiv.2309.00214 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2309_00214</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2309_00214</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-1832ba5346d710aaf83b5028b3a3024cb44259382361e65e81b96433a699b45e3</originalsourceid><addsrcrecordid>eNotzrsKwjAUgOEsDqI-gJN9gdYk5yRNRineQFHEvZzUVCPeiCLq04uX6d9-Psa6gmdolOJ9io9wzyRwm3EuBTZZsvLb6G_pPJzCMbzCaZss43nvq1tS7M6h8m3WqOlw9Z1_W2w9Gq6LSTpbjKfFYJaSzjEVBqQjBag3ueBEtQGnuDQOCLjEyiFKZcFI0MJr5Y1wViMAaWsdKg8t1vttv8TyEsOR4rP8UMsvFd4u-zZK</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Regret-Minimizing Project Choice</title><source>arXiv.org</source><creator>Guo, Yingni ; Shmaya, Eran</creator><creatorcontrib>Guo, Yingni ; Shmaya, Eran</creatorcontrib><description>An agent observes the set of available projects and proposes some, but not
necessarily all, of them. A principal chooses one or none from the proposed
set. We solve for a mechanism that minimizes the principal's worst-case regret.
We compare the single-project environment in which the agent can propose only
one project with the multiproject environment in which he can propose many. In
both environments, if the agent proposes one project, it is chosen for sure if
the principal's payoff is sufficiently high; otherwise, the probability that it
is chosen decreases in the agent's payoff. In the multiproject environment, the
agent's payoff from proposing multiple projects equals his maximal payoff from
proposing each project alone. The multiproject environment outperforms the
single-project one by providing better fallback options than rejection and by
delivering this payoff to the agent more efficiently.</description><identifier>DOI: 10.48550/arxiv.2309.00214</identifier><language>eng</language><creationdate>2023-08</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/2309.00214$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2309.00214$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Guo, Yingni</creatorcontrib><creatorcontrib>Shmaya, Eran</creatorcontrib><title>Regret-Minimizing Project Choice</title><description>An agent observes the set of available projects and proposes some, but not
necessarily all, of them. A principal chooses one or none from the proposed
set. We solve for a mechanism that minimizes the principal's worst-case regret.
We compare the single-project environment in which the agent can propose only
one project with the multiproject environment in which he can propose many. In
both environments, if the agent proposes one project, it is chosen for sure if
the principal's payoff is sufficiently high; otherwise, the probability that it
is chosen decreases in the agent's payoff. In the multiproject environment, the
agent's payoff from proposing multiple projects equals his maximal payoff from
proposing each project alone. The multiproject environment outperforms the
single-project one by providing better fallback options than rejection and by
delivering this payoff to the agent more efficiently.</description><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsKwjAUgOEsDqI-gJN9gdYk5yRNRineQFHEvZzUVCPeiCLq04uX6d9-Psa6gmdolOJ9io9wzyRwm3EuBTZZsvLb6G_pPJzCMbzCaZss43nvq1tS7M6h8m3WqOlw9Z1_W2w9Gq6LSTpbjKfFYJaSzjEVBqQjBag3ueBEtQGnuDQOCLjEyiFKZcFI0MJr5Y1wViMAaWsdKg8t1vttv8TyEsOR4rP8UMsvFd4u-zZK</recordid><startdate>20230831</startdate><enddate>20230831</enddate><creator>Guo, Yingni</creator><creator>Shmaya, Eran</creator><scope>ADEOX</scope><scope>GOX</scope></search><sort><creationdate>20230831</creationdate><title>Regret-Minimizing Project Choice</title><author>Guo, Yingni ; Shmaya, Eran</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-1832ba5346d710aaf83b5028b3a3024cb44259382361e65e81b96433a699b45e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Guo, Yingni</creatorcontrib><creatorcontrib>Shmaya, Eran</creatorcontrib><collection>arXiv Economics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Guo, Yingni</au><au>Shmaya, Eran</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Regret-Minimizing Project Choice</atitle><date>2023-08-31</date><risdate>2023</risdate><abstract>An agent observes the set of available projects and proposes some, but not
necessarily all, of them. A principal chooses one or none from the proposed
set. We solve for a mechanism that minimizes the principal's worst-case regret.
We compare the single-project environment in which the agent can propose only
one project with the multiproject environment in which he can propose many. In
both environments, if the agent proposes one project, it is chosen for sure if
the principal's payoff is sufficiently high; otherwise, the probability that it
is chosen decreases in the agent's payoff. In the multiproject environment, the
agent's payoff from proposing multiple projects equals his maximal payoff from
proposing each project alone. The multiproject environment outperforms the
single-project one by providing better fallback options than rejection and by
delivering this payoff to the agent more efficiently.</abstract><doi>10.48550/arxiv.2309.00214</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2309.00214 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2309_00214 |
| source | arXiv.org |
| title | Regret-Minimizing Project Choice |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T15%3A22%3A36IST&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=Regret-Minimizing%20Project%20Choice&rft.au=Guo,%20Yingni&rft.date=2023-08-31&rft_id=info:doi/10.48550/arxiv.2309.00214&rft_dat=%3Carxiv_GOX%3E2309_00214%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 |