Bidding Languages for Combinatorial Auctions
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 1211-1216.
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.
@inproceedings{ijcai2001p160,
title = {Bidding Languages for Combinatorial Auctions},
author = {Boutilier, Craig and Hoos, Holger H.},
booktitle = {Proceedings of the Seventeenth International Joint Conference on
Artificial Intelligence, {IJCAI-01}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {1211--1216},
year = {2001},
url = {https://ijcai.org/proceedings/2001/160},
}
TY - CPAPER TI - Bidding Languages for Combinatorial Auctions AU - Boutilier, Craig AU - Hoos, Holger H. T2 - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 PB - International Joint Conferences on Artificial Intelligence PY - 2001 SP - 1211 EP - 1216 UR - https://ijcai.org/proceedings/2001/160 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
