Approximations to auctions of digital goods with share-averse bidders
We consider the case of a digital product for share-averse bidders, where the product can be sold to multiple buyers who experience some disutility from other firms or consumers owning the same product. We model the problem of selling a digital product to share-averse bidders as an auction and apply...
Gespeichert in:
| Veröffentlicht in: | Electronic commerce research and applications 2014-03, Vol.13 (2), p.128-138 |
|---|---|
| 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 | 138 |
|---|---|
| container_issue | 2 |
| container_start_page | 128 |
| container_title | Electronic commerce research and applications |
| container_volume | 13 |
| creator | Pei, Jinxiang Klabjan, Diego Xie, Wei |
| description | We consider the case of a digital product for share-averse bidders, where the product can be sold to multiple buyers who experience some disutility from other firms or consumers owning the same product. We model the problem of selling a digital product to share-averse bidders as an auction and apply a Bayesian optimal mechanism design. We also design constant-approximation algorithms in the prior-free setting including both average- and worst-case analyses. |
| doi_str_mv | 10.1016/j.elerap.2013.11.001 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1511089011</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1567422313000689</els_id><sourcerecordid>3259578551</sourcerecordid><originalsourceid>FETCH-LOGICAL-c365t-38cc3a692ee00d4c21aaac5ed6f0b173ca281b9fb9f482fcbfcfd23299eb2ab63</originalsourceid><addsrcrecordid>eNp9UE1LAzEUDKJgrf4DDwued81L9vMilFI_oOBFzyGbvLRZarMmadV_b8p6Fh68OczMezOE3AItgEJ9PxS4Qy_HglHgBUBBKZyRGbQNz5u2rM8TruomLxnjl-QqhIFSRjtazchqMY7efdsPGa3bhyy6TB7UhJ3JtN3YKHfZxjkdsi8bt1nYSo-5PKIPmPVW6wSuyYWRu4A3f3tO3h9Xb8vnfP369LJcrHPF6yrmvFWKy7pjiJTqUjGQUqoKdW1oDw1XkrXQdyZN2TKjeqOMZpx1HfZM9jWfk7vJN_38ecAQxeAOfp9OCqgAaNtRgMQqJ5byLgSPRow-BfQ_Aqg4FSYGMRUmToUJAJEKS7KHSYYpwdGiF0FZ3CvU1qOKQjv7v8EviUJ3Kg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1511089011</pqid></control><display><type>article</type><title>Approximations to auctions of digital goods with share-averse bidders</title><source>Elsevier ScienceDirect Journals</source><creator>Pei, Jinxiang ; Klabjan, Diego ; Xie, Wei</creator><creatorcontrib>Pei, Jinxiang ; Klabjan, Diego ; Xie, Wei</creatorcontrib><description>We consider the case of a digital product for share-averse bidders, where the product can be sold to multiple buyers who experience some disutility from other firms or consumers owning the same product. We model the problem of selling a digital product to share-averse bidders as an auction and apply a Bayesian optimal mechanism design. We also design constant-approximation algorithms in the prior-free setting including both average- and worst-case analyses.</description><identifier>ISSN: 1567-4223</identifier><identifier>EISSN: 1873-7846</identifier><identifier>DOI: 10.1016/j.elerap.2013.11.001</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Auction ; Auctions ; Constant-approximation algorithms ; Electronic commerce ; Prior-free algorithms ; Share-averse bidders ; Studies</subject><ispartof>Electronic commerce research and applications, 2014-03, Vol.13 (2), p.128-138</ispartof><rights>2013 Elsevier B.V.</rights><rights>Copyright © 2014 Elsevier B.V. All rights reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c365t-38cc3a692ee00d4c21aaac5ed6f0b173ca281b9fb9f482fcbfcfd23299eb2ab63</citedby><cites>FETCH-LOGICAL-c365t-38cc3a692ee00d4c21aaac5ed6f0b173ca281b9fb9f482fcbfcfd23299eb2ab63</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S1567422313000689$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids></links><search><creatorcontrib>Pei, Jinxiang</creatorcontrib><creatorcontrib>Klabjan, Diego</creatorcontrib><creatorcontrib>Xie, Wei</creatorcontrib><title>Approximations to auctions of digital goods with share-averse bidders</title><title>Electronic commerce research and applications</title><description>We consider the case of a digital product for share-averse bidders, where the product can be sold to multiple buyers who experience some disutility from other firms or consumers owning the same product. We model the problem of selling a digital product to share-averse bidders as an auction and apply a Bayesian optimal mechanism design. We also design constant-approximation algorithms in the prior-free setting including both average- and worst-case analyses.</description><subject>Algorithms</subject><subject>Auction</subject><subject>Auctions</subject><subject>Constant-approximation algorithms</subject><subject>Electronic commerce</subject><subject>Prior-free algorithms</subject><subject>Share-averse bidders</subject><subject>Studies</subject><issn>1567-4223</issn><issn>1873-7846</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNp9UE1LAzEUDKJgrf4DDwued81L9vMilFI_oOBFzyGbvLRZarMmadV_b8p6Fh68OczMezOE3AItgEJ9PxS4Qy_HglHgBUBBKZyRGbQNz5u2rM8TruomLxnjl-QqhIFSRjtazchqMY7efdsPGa3bhyy6TB7UhJ3JtN3YKHfZxjkdsi8bt1nYSo-5PKIPmPVW6wSuyYWRu4A3f3tO3h9Xb8vnfP369LJcrHPF6yrmvFWKy7pjiJTqUjGQUqoKdW1oDw1XkrXQdyZN2TKjeqOMZpx1HfZM9jWfk7vJN_38ecAQxeAOfp9OCqgAaNtRgMQqJ5byLgSPRow-BfQ_Aqg4FSYGMRUmToUJAJEKS7KHSYYpwdGiF0FZ3CvU1qOKQjv7v8EviUJ3Kg</recordid><startdate>20140301</startdate><enddate>20140301</enddate><creator>Pei, Jinxiang</creator><creator>Klabjan, Diego</creator><creator>Xie, Wei</creator><general>Elsevier B.V</general><general>Elsevier BV</general><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope></search><sort><creationdate>20140301</creationdate><title>Approximations to auctions of digital goods with share-averse bidders</title><author>Pei, Jinxiang ; Klabjan, Diego ; Xie, Wei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c365t-38cc3a692ee00d4c21aaac5ed6f0b173ca281b9fb9f482fcbfcfd23299eb2ab63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Auction</topic><topic>Auctions</topic><topic>Constant-approximation algorithms</topic><topic>Electronic commerce</topic><topic>Prior-free algorithms</topic><topic>Share-averse bidders</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pei, Jinxiang</creatorcontrib><creatorcontrib>Klabjan, Diego</creatorcontrib><creatorcontrib>Xie, Wei</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><jtitle>Electronic commerce research and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Pei, Jinxiang</au><au>Klabjan, Diego</au><au>Xie, Wei</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Approximations to auctions of digital goods with share-averse bidders</atitle><jtitle>Electronic commerce research and applications</jtitle><date>2014-03-01</date><risdate>2014</risdate><volume>13</volume><issue>2</issue><spage>128</spage><epage>138</epage><pages>128-138</pages><issn>1567-4223</issn><eissn>1873-7846</eissn><abstract>We consider the case of a digital product for share-averse bidders, where the product can be sold to multiple buyers who experience some disutility from other firms or consumers owning the same product. We model the problem of selling a digital product to share-averse bidders as an auction and apply a Bayesian optimal mechanism design. We also design constant-approximation algorithms in the prior-free setting including both average- and worst-case analyses.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.elerap.2013.11.001</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1567-4223 |
| ispartof | Electronic commerce research and applications, 2014-03, Vol.13 (2), p.128-138 |
| issn | 1567-4223 1873-7846 |
| language | eng |
| recordid | cdi_proquest_journals_1511089011 |
| source | Elsevier ScienceDirect Journals |
| subjects | Algorithms Auction Auctions Constant-approximation algorithms Electronic commerce Prior-free algorithms Share-averse bidders Studies |
| title | Approximations to auctions of digital goods with share-averse bidders |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T05%3A40%3A08IST&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=Approximations%20to%20auctions%20of%20digital%20goods%20with%20share-averse%20bidders&rft.jtitle=Electronic%20commerce%20research%20and%20applications&rft.au=Pei,%20Jinxiang&rft.date=2014-03-01&rft.volume=13&rft.issue=2&rft.spage=128&rft.epage=138&rft.pages=128-138&rft.issn=1567-4223&rft.eissn=1873-7846&rft_id=info:doi/10.1016/j.elerap.2013.11.001&rft_dat=%3Cproquest_cross%3E3259578551%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=1511089011&rft_id=info:pmid/&rft_els_id=S1567422313000689&rfr_iscdi=true |