@InCollection{narumanchi06a,
  author =	 {Muralidhar V. Narumanchi and Jos\'{e} M. Vidal},
  title =	 {Algorithms for Distributed Winner Determination In
                  Combinatorial Auctions},
  booktitle =	 {Agent-Mediated Electronic Commerce. Designing Trading Agents and Mechanisms},
  publisher =	 {Springer},
  pages = 	 {43--56},
  year =	 2006,
  abstract =	 {The problem of optimal winner determination in
                  combinatorial auctions consists of finding the set
                  of bids that maximize the revenue for the
                  sellers. Various solutions exist for solving this
                  problem but they are all centralized. That is, they
                  assume that all bids are sent to a centralized
                  auctioneer who then determines the winning set of
                  bids. In this paper we introduce the problem of
                  distributed winner determination in combinatorial
                  auctions which eliminates the centralized
                  auctioneer. We present a set of distributed
                  search-based algorithms for solving this problem and
                  study their relative tradeoffs.},
  doi = 	 {10.1007/11888727_4},
  isbn = 	 {978-3-540-46242-2},
  url = 	 {http://jmvidal.cse.sc.edu/papers/narumanchi06a.pdf},
  keywords = 	 {multiagent combinatorial auctions},
  cluster = 	 {1893976291616527676}
}