Winner determination in combinatorial auctions with logic-based bidding languages

Open Access
Authors
Publication date 2008
Host editors
  • L. Padgham
  • D. Parkes
  • J. Müller
  • S. Parsons
Book title AAMAS 2008: 7th International Conference on Autonomous Agents and Multi-Agent Systems: Proceedings: Volume 3
ISBN
  • 978-0-9817381-2-X
Event 7th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2008), Estoril, Portugal
Pages (from-to) 1617-1620
Publisher Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract We propose the use of logic-based preference representation languages based on weighted propositional formulas for specifying bids in a combinatorial auction. We then develop several heuristics for a branch-and-bound search algorithm for determining the winning bids in this framework and report on their empirical performance. The logic-based approach is attractive due to its high degree of flexibility in designing a range of different bidding languages within a single conceptual framework.
Document type Conference contribution
Published at http://portal.acm.org/citation.cfm?id=1402939
Downloads
Permalink to this page
Back