@InProceedings{boutilier01a,
  author =	 {Craig Boutilier and Holger H. Hoos},
  title =	 {Bidding Languages for Combinatorial Auctions},
  booktitle =	 { Proceedings of the Seventeenth International Joint
                  Conference on Artificial Intelligence},
  pages =	 {1211--1217},
  year =	 2001,
  abstract =	 {Combinatorial auctions provide a valuable mechanism
                  for the allocation of goods in settings where buyer
                  valuations exhibit complex structure with respect to
                  substitutability and complementarity. Most
                  algorithms are designed to work with explicit bids
                  for concrete bundles of goods. However, logical
                  bidding languages allow the expression of complex
                  utility functions in a natural and concise way. We
                  introduce a new, generalized language where bids are
                  given by propositional formulae whose subformulae
                  can be annotated with prices. This language allows
                  bidder utilities to be formulated more naturally and
                  concisely than existing languages. Furthermore, we
                  outline a general algorithmic technique for winner
                  determination for auctions that use this bidding
                  language.},
  keywords =     {ai combinatorial auctions},
  url = 	 {http://jmvidal.cse.sc.edu/library/boutilier01a.pdf},
  googleid = 	 {LiOOtOYlgt0J:scholar.google.com/},
  cluster = 	 {15961361702156378926}
}