Art

J-GLOBAL ID：201402231565688964   Reference number：14A0638830

Time Complexity Analysis of Iterative Auctions with Multiple Differentiated Items

複数の分化アイテムのある反復競売の時間複雑性解析

Author (3)： MUROTA Kazuo (Univ. Tokyo, Tokyo, JPN) ,  SHIOURA Akiyoshi (Tohoku Univ., Sendai, JPN) ,  YANG Zaifu (Univ. York, York, GBR)
Material： 電子情報通信学会技術研究報告  (IEICE Technical Report (Institute of Electronics, Information and Communication Engineers))
Volume： 114  Issue： 19(COMP2014 1-7)  Page： 45-51  Publication year： Apr. 17, 2014 
JST Material Number： S0532B  ISSN： 0913-5685  Document type： Proceedings
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *differentiation (biology) ,  *transaction ,  Motion ,  *time analysis ,  property ,  utilization ,  evaluation ,  equilibrium ,  discrete system ,  Mathematics ,  algorithm ,  Walrasian equilibrium ,  *complexity
Semi thesaurus term： *auction ,  Effective algorithm ,  substitution ,  convex analysis ,  *repetitive motion

JST classification (1)： Theory of computation  (JB02000A)

Reference (21)：

• L. M. Ausubel. An efficient dynamic auction for heterogeneous commodities. American Economic Review, 96 (2006) 602-629.
• L. M. Ausubel and P. Milgrom. Ascending auctions with package bidding. Front. Theor. Econ., 1 (2002) Article 1.
• M. Bichler, P. Shabalin, and A. Pikovsky. A computational analysis of linear price iterative combinatorial auction formats. Inform. Syst. Res. 20 (2009), 33-59.
• M. Bing, D. Lehmann, and P. Milgrom. Presentation and structure of substitutes valuations. Proc. EC 2004,238-239.
• L. Blumrosen and N. Nisan. Combinatorial auction. in: N. Nisan, et al. (eds.) Algorithmic Game Theory, pp. 267-299. Cambridge Univ. Press, 2007.

Terms in the title (5)： 分化 ,  反復 ,  競売 ,  複雑性 ,  解析