{"updated":"2025-01-20T06:51:17.078100+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00082249","sets":["581:6644:6781"]},"path":["6781"],"owner":"11","recid":"82249","title":["A Decision Method in B2B E-Commerce Model based on Multi-Items Auction"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-05-15"},"_buckets":{"deposit":"8a67302d-c815-4cf1-8349-30401e0cd7d2"},"_deposit":{"id":"82249","pid":{"type":"depid","value":"82249","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"A Decision Method in B2B E-Commerce Model based on Multi-Items Auction","author_link":["357988","357986","357985","357987"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Decision Method in B2B E-Commerce Model based on Multi-Items Auction"},{"subitem_title":"A Decision Method in B2B E-Commerce Model based on Multi-Items Auction","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[Special Issue on Theory and Application of Intelligent Information Technology] procurement auction, B2B e-commerce, coalition making, auction protocol","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2012-05-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Systems & Information Engineering, University of Tsukuba"},{"subitem_text_value":"Graduate School of Science & Engineering, Yamagata University"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Systems & Information Engineering, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Science & Engineering, Yamagata University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":11,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/82249/files/IPSJ-JNL5305017.pdf","label":"IPSJ-JNL5305017"},"date":[{"dateType":"Available","dateValue":"2014-05-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5305017.pdf","filesize":[{"value":"325.8 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"adc55791-6f24-43a6-9fe4-97c0e6ca5676","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Satoshi, Takahashi"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tokuro, Matsuo"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Satoshi, Takahashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tokuro, Matsuo","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"This paper proposes a new B2B electronic commerce model from bidding information in double auctions. In B2B electronic commerce, buyers try to purchase multiple items at the same time, since a buyer develops something products by using purchased items. Also suppliers have an incentive of making coalitions, since buyers want to purchase multiple items in the model. A mechanism designer has to consider an optimal mechanism which calculates an optimal matching between buyers and suppliers. To find an optimal matching is very hard, since a mechanism calculates all combinations between buyers and suppliers. Consequently, we propose a calculation method which has two steps; first the mechanism determines winners of buyers' side, second the mechanism determines coalitions and winners of suppliers by using the result of buyers' side. This paper also discusses the improved method with dynamical mechanism design by using the bidding information. Advantages of this paper are that each d eveloper can procure the components to develop a certain item and tasks are allocated to suppliers effectively. The previous result of auction data can be available to shorten the period of winner determinations. Contribution of this paper includes two parts. One is creating a mathematical model of procurement auction, which is able to apply to practical situation. The other is proposing dynamic mechanism for the procurement auction.\n\n------------------------------ \nThis is a preprint of an article intended for publication Journal of \nInformation Processing(JIP). This preprint should not be cited. This \narticle should be cited as: Journal of Information Processing Vol.20(2012) No.3 (online) \nDOI　http://dx.doi.org/10.2197/ipsjjip.20.649\n------------------------------ \n","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper proposes a new B2B electronic commerce model from bidding information in double auctions. In B2B electronic commerce, buyers try to purchase multiple items at the same time, since a buyer develops something products by using purchased items. Also suppliers have an incentive of making coalitions, since buyers want to purchase multiple items in the model. A mechanism designer has to consider an optimal mechanism which calculates an optimal matching between buyers and suppliers. To find an optimal matching is very hard, since a mechanism calculates all combinations between buyers and suppliers. Consequently, we propose a calculation method which has two steps; first the mechanism determines winners of buyers' side, second the mechanism determines coalitions and winners of suppliers by using the result of buyers' side. This paper also discusses the improved method with dynamical mechanism design by using the bidding information. Advantages of this paper are that each d eveloper can procure the components to develop a certain item and tasks are allocated to suppliers effectively. The previous result of auction data can be available to shorten the period of winner determinations. Contribution of this paper includes two parts. One is creating a mathematical model of procurement auction, which is able to apply to practical situation. The other is proposing dynamic mechanism for the procurement auction.\n\n------------------------------ \nThis is a preprint of an article intended for publication Journal of \nInformation Processing(JIP). This preprint should not be cited. This \narticle should be cited as: Journal of Information Processing Vol.20(2012) No.3 (online) \nDOI　http://dx.doi.org/10.2197/ipsjjip.20.649\n------------------------------ \n","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2012-05-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"53"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:36:10.551396+00:00","id":82249,"links":{}}