@techreport{oai:ipsj.ixsq.nii.ac.jp:00034758,
 author = {Chihiro, Ono and Satoshi, Nishiyama and Hiroki, Horiuchi and Chihiro, Ono and Satoshi, Nishiyama and Hiroki, Horiuchi},
 issue = {32(2001-DPS-107)},
 month = {Mar},
 note = {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., 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.},
 title = {AN EFFIEICNT WINNER DETERMINATION ALGOLITHM FOR COMBINATORIAL ASCENDING AUCIONS},
 year = {2002}
}