{"updated":"2025-01-22T15:02:47.915736+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00034758","sets":["1164:2836:2870:2874"]},"path":["2874"],"owner":"1","recid":"34758","title":["AN EFFIEICNT WINNER DETERMINATION ALGOLITHM FOR COMBINATORIAL ASCENDING AUCIONS"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-03-28"},"_buckets":{"deposit":"708e370a-5bac-43f6-ad6e-6d1e43cba910"},"_deposit":{"id":"34758","pid":{"type":"depid","value":"34758","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"AN EFFIEICNT WINNER DETERMINATION ALGOLITHM FOR COMBINATORIAL ASCENDING AUCIONS","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"AN EFFIEICNT WINNER DETERMINATION ALGOLITHM FOR COMBINATORIAL ASCENDING AUCIONS"},{"subitem_title":"AN EFFIEICNT WINNER DETERMINATION ALGOLITHM FOR COMBINATORIAL ASCENDING AUCIONS","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2002-03-28","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"KDDI R&D Laboratories  Inc."},{"subitem_text_value":"KDDI R&D Laboratories  Inc."},{"subitem_text_value":"KDDI R&D Laboratories  Inc."}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"KDDI R&D Laboratories, Inc.","subitem_text_language":"en"},{"subitem_text_value":"KDDI R&D Laboratories, Inc.","subitem_text_language":"en"},{"subitem_text_value":"KDDI R&D Laboratories, Inc.","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/34758/files/IPSJ-DPS01107023.pdf"},"date":[{"dateType":"Available","dateValue":"2004-03-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DPS01107023.pdf","filesize":[{"value":"139.6 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"34"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"74d3e190-9e6d-4da0-9207-abfedc9faf0c","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Chihiro, Ono"},{"creatorName":"Satoshi, Nishiyama"},{"creatorName":"Hiroki, Horiuchi"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Chihiro, Ono","creatorNameLang":"en"},{"creatorName":"Satoshi, Nishiyama","creatorNameLang":"en"},{"creatorName":"Hiroki, Horiuchi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10116224","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"In this paper we study combinatorial auctions where bidders can quote for a combination of the objects being sold. In a previous article we have proposed a combinatorial ascending auction where the bidders can place a bit at an arbitrary timing via the Internet. For combinatorial auctions  computational complexity increases exponentially as the number of possible combination increases. Although some algorithms for reducing the complexity have been proposed  they are only suitable for the one-shot auctions where bidders submit bids only once simultaneously. Thus  we can improve the performance by making use of the previous valuation for doing next valuation. In this paper we propose a method to reduce computational burden for combinatorial ascending auctions and verify the effectiveness of the algorithm through the evaluation.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper we study combinatorial auctions where bidders can quote for a combination of the objects being sold. In a previous article we have proposed a combinatorial ascending auction where the bidders can place a bit at an arbitrary timing via the Internet. For combinatorial auctions, computational complexity increases exponentially as the number of possible combination increases. Although some algorithms for reducing the complexity have been proposed, they are only suitable for the one-shot auctions where bidders submit bids only once simultaneously. Thus, we can improve the performance by making use of the previous valuation for doing next valuation. In this paper we propose a method to reduce computational burden for combinatorial ascending auctions and verify the effectiveness of the algorithm through the evaluation.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"138","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告マルチメディア通信と分散処理（DPS）"}],"bibliographicPageStart":"133","bibliographicIssueDates":{"bibliographicIssueDate":"2002-03-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"32(2001-DPS-107)","bibliographicVolumeNumber":"2002"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:03:16.134915+00:00","id":34758,"links":{}}