Fast core pricing algorithms for path auction
Path auction is held in a graph, where each edge stands for a commodity and the weight of this edge represents the prime cost. Bidders own some edges and make bids for their edges. The auctioneer needs to purchase a sequence of edges to form a path between two specific vertices. Path auction can be...
Gespeichert in:
| Veröffentlicht in: | Autonomous agents and multi-agent systems 2020-04, Vol.34 (1), Article 18 |
|---|---|
| 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 | |
|---|---|
| container_issue | 1 |
| container_start_page | |
| container_title | Autonomous agents and multi-agent systems |
| container_volume | 34 |
| creator | Cheng, Hao Zhang, Wentao Zhang, Yi Zhang, Lei Wu, Jun Wang, Chongjun |
| description | Path auction is held in a graph, where each edge stands for a commodity and the weight of this edge represents the prime cost. Bidders own some edges and make bids for their edges. The auctioneer needs to purchase a sequence of edges to form a path between two specific vertices. Path auction can be considered as a kind of combinatorial reverse auctions. Core-selecting mechanism is a prevalent mechanism for combinatorial auction. However, pricing in core-selecting combinatorial auction is computationally expensive, one important reason is the exponential core constraints. The same is true of path auction. To solve this computation problem, we simplify the constraint set and get the optimal set with only polynomial constraints in this paper. Based on our constraint set, we put forward two fast core pricing algorithms for the computation of bidder-Pareto-optimal core outcome. Among all the algorithms, our new algorithms have remarkable runtime performance. Finally, we validate our algorithms on real-world datasets and obtain excellent results. |
| doi_str_mv | 10.1007/s10458-019-09440-y |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2343276773</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2343276773</sourcerecordid><originalsourceid>FETCH-LOGICAL-c270t-3d291688a8f826b5527da77cc0072b4bfb0125440d9f4a5990da19760afdfcb73</originalsourceid><addsrcrecordid>eNp9kD9PwzAQxS0EEqXwBZgiMRvO_3LxiCoKSJVYYLYcJ25TtXGw0yHfHkOQ2JjuhvfevfsRcsvgngHgQ2IgVUWBaQpaSqDTGVkwhYKiVPI876JCypXgl-QqpT0AK3nJFoSubRoLF2JbDLFzXb8t7GEbYjfujqnwIRaDHXeFPbmxC_01ufD2kNqb37kkH-un99UL3bw9v64eN9RxhJGKhmtWVpWtfMXLWimOjUV0Llfltax9DYyrXLPRXlqlNTSWaSzB-sa7GsWS3M25QwyfpzaNZh9Osc8nDRdScCwRRVbxWeViSCm23uQXjjZOhoH5xmJmLCZjMT9YzJRNYjalLO63bfyL_sf1BZ7JZHw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2343276773</pqid></control><display><type>article</type><title>Fast core pricing algorithms for path auction</title><source>SpringerNature Journals</source><creator>Cheng, Hao ; Zhang, Wentao ; Zhang, Yi ; Zhang, Lei ; Wu, Jun ; Wang, Chongjun</creator><creatorcontrib>Cheng, Hao ; Zhang, Wentao ; Zhang, Yi ; Zhang, Lei ; Wu, Jun ; Wang, Chongjun</creatorcontrib><description>Path auction is held in a graph, where each edge stands for a commodity and the weight of this edge represents the prime cost. Bidders own some edges and make bids for their edges. The auctioneer needs to purchase a sequence of edges to form a path between two specific vertices. Path auction can be considered as a kind of combinatorial reverse auctions. Core-selecting mechanism is a prevalent mechanism for combinatorial auction. However, pricing in core-selecting combinatorial auction is computationally expensive, one important reason is the exponential core constraints. The same is true of path auction. To solve this computation problem, we simplify the constraint set and get the optimal set with only polynomial constraints in this paper. Based on our constraint set, we put forward two fast core pricing algorithms for the computation of bidder-Pareto-optimal core outcome. Among all the algorithms, our new algorithms have remarkable runtime performance. Finally, we validate our algorithms on real-world datasets and obtain excellent results.</description><identifier>ISSN: 1387-2532</identifier><identifier>EISSN: 1573-7454</identifier><identifier>DOI: 10.1007/s10458-019-09440-y</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Apexes ; Artificial Intelligence ; Combinatorial analysis ; Computation ; Computer Science ; Computer Systems Organization and Communication Networks ; Graph theory ; Microprocessors ; Polynomials ; Pricing ; Software Engineering/Programming and Operating Systems ; User Interfaces and Human Computer Interaction</subject><ispartof>Autonomous agents and multi-agent systems, 2020-04, Vol.34 (1), Article 18</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2020</rights><rights>Springer Science+Business Media, LLC, part of Springer Nature 2020.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c270t-3d291688a8f826b5527da77cc0072b4bfb0125440d9f4a5990da19760afdfcb73</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/s10458-019-09440-y$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10458-019-09440-y$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Cheng, Hao</creatorcontrib><creatorcontrib>Zhang, Wentao</creatorcontrib><creatorcontrib>Zhang, Yi</creatorcontrib><creatorcontrib>Zhang, Lei</creatorcontrib><creatorcontrib>Wu, Jun</creatorcontrib><creatorcontrib>Wang, Chongjun</creatorcontrib><title>Fast core pricing algorithms for path auction</title><title>Autonomous agents and multi-agent systems</title><addtitle>Auton Agent Multi-Agent Syst</addtitle><description>Path auction is held in a graph, where each edge stands for a commodity and the weight of this edge represents the prime cost. Bidders own some edges and make bids for their edges. The auctioneer needs to purchase a sequence of edges to form a path between two specific vertices. Path auction can be considered as a kind of combinatorial reverse auctions. Core-selecting mechanism is a prevalent mechanism for combinatorial auction. However, pricing in core-selecting combinatorial auction is computationally expensive, one important reason is the exponential core constraints. The same is true of path auction. To solve this computation problem, we simplify the constraint set and get the optimal set with only polynomial constraints in this paper. Based on our constraint set, we put forward two fast core pricing algorithms for the computation of bidder-Pareto-optimal core outcome. Among all the algorithms, our new algorithms have remarkable runtime performance. Finally, we validate our algorithms on real-world datasets and obtain excellent results.</description><subject>Algorithms</subject><subject>Apexes</subject><subject>Artificial Intelligence</subject><subject>Combinatorial analysis</subject><subject>Computation</subject><subject>Computer Science</subject><subject>Computer Systems Organization and Communication Networks</subject><subject>Graph theory</subject><subject>Microprocessors</subject><subject>Polynomials</subject><subject>Pricing</subject><subject>Software Engineering/Programming and Operating Systems</subject><subject>User Interfaces and Human Computer Interaction</subject><issn>1387-2532</issn><issn>1573-7454</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp9kD9PwzAQxS0EEqXwBZgiMRvO_3LxiCoKSJVYYLYcJ25TtXGw0yHfHkOQ2JjuhvfevfsRcsvgngHgQ2IgVUWBaQpaSqDTGVkwhYKiVPI876JCypXgl-QqpT0AK3nJFoSubRoLF2JbDLFzXb8t7GEbYjfujqnwIRaDHXeFPbmxC_01ufD2kNqb37kkH-un99UL3bw9v64eN9RxhJGKhmtWVpWtfMXLWimOjUV0Llfltax9DYyrXLPRXlqlNTSWaSzB-sa7GsWS3M25QwyfpzaNZh9Osc8nDRdScCwRRVbxWeViSCm23uQXjjZOhoH5xmJmLCZjMT9YzJRNYjalLO63bfyL_sf1BZ7JZHw</recordid><startdate>20200401</startdate><enddate>20200401</enddate><creator>Cheng, Hao</creator><creator>Zhang, Wentao</creator><creator>Zhang, Yi</creator><creator>Zhang, Lei</creator><creator>Wu, Jun</creator><creator>Wang, Chongjun</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20200401</creationdate><title>Fast core pricing algorithms for path auction</title><author>Cheng, Hao ; Zhang, Wentao ; Zhang, Yi ; Zhang, Lei ; Wu, Jun ; Wang, Chongjun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c270t-3d291688a8f826b5527da77cc0072b4bfb0125440d9f4a5990da19760afdfcb73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Apexes</topic><topic>Artificial Intelligence</topic><topic>Combinatorial analysis</topic><topic>Computation</topic><topic>Computer Science</topic><topic>Computer Systems Organization and Communication Networks</topic><topic>Graph theory</topic><topic>Microprocessors</topic><topic>Polynomials</topic><topic>Pricing</topic><topic>Software Engineering/Programming and Operating Systems</topic><topic>User Interfaces and Human Computer Interaction</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cheng, Hao</creatorcontrib><creatorcontrib>Zhang, Wentao</creatorcontrib><creatorcontrib>Zhang, Yi</creatorcontrib><creatorcontrib>Zhang, Lei</creatorcontrib><creatorcontrib>Wu, Jun</creatorcontrib><creatorcontrib>Wang, Chongjun</creatorcontrib><collection>CrossRef</collection><jtitle>Autonomous agents and multi-agent systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cheng, Hao</au><au>Zhang, Wentao</au><au>Zhang, Yi</au><au>Zhang, Lei</au><au>Wu, Jun</au><au>Wang, Chongjun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fast core pricing algorithms for path auction</atitle><jtitle>Autonomous agents and multi-agent systems</jtitle><stitle>Auton Agent Multi-Agent Syst</stitle><date>2020-04-01</date><risdate>2020</risdate><volume>34</volume><issue>1</issue><artnum>18</artnum><issn>1387-2532</issn><eissn>1573-7454</eissn><abstract>Path auction is held in a graph, where each edge stands for a commodity and the weight of this edge represents the prime cost. Bidders own some edges and make bids for their edges. The auctioneer needs to purchase a sequence of edges to form a path between two specific vertices. Path auction can be considered as a kind of combinatorial reverse auctions. Core-selecting mechanism is a prevalent mechanism for combinatorial auction. However, pricing in core-selecting combinatorial auction is computationally expensive, one important reason is the exponential core constraints. The same is true of path auction. To solve this computation problem, we simplify the constraint set and get the optimal set with only polynomial constraints in this paper. Based on our constraint set, we put forward two fast core pricing algorithms for the computation of bidder-Pareto-optimal core outcome. Among all the algorithms, our new algorithms have remarkable runtime performance. Finally, we validate our algorithms on real-world datasets and obtain excellent results.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10458-019-09440-y</doi></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1387-2532 |
| ispartof | Autonomous agents and multi-agent systems, 2020-04, Vol.34 (1), Article 18 |
| issn | 1387-2532 1573-7454 |
| language | eng |
| recordid | cdi_proquest_journals_2343276773 |
| source | SpringerNature Journals |
| subjects | Algorithms Apexes Artificial Intelligence Combinatorial analysis Computation Computer Science Computer Systems Organization and Communication Networks Graph theory Microprocessors Polynomials Pricing Software Engineering/Programming and Operating Systems User Interfaces and Human Computer Interaction |
| title | Fast core pricing algorithms for path auction |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T23%3A54%3A55IST&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=Fast%20core%20pricing%20algorithms%20for%20path%20auction&rft.jtitle=Autonomous%20agents%20and%20multi-agent%20systems&rft.au=Cheng,%20Hao&rft.date=2020-04-01&rft.volume=34&rft.issue=1&rft.artnum=18&rft.issn=1387-2532&rft.eissn=1573-7454&rft_id=info:doi/10.1007/s10458-019-09440-y&rft_dat=%3Cproquest_cross%3E2343276773%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=2343276773&rft_id=info:pmid/&rfr_iscdi=true |