Rule-Based Specification of Auction Mechanisms

Machine-readable specifications of auction mechanisms facilitate configurable implementation of computational markets, as well as standardization and formalization of the auction design space. We present an implemented rule-based scripting language for auctions, which provides constructs for specify...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Autonomous Agents and Multiagent Systems: Proceedings, 3rd International Joint Conference, New York City, New York, 2004. s. 818 - 825
Hlavní autoři: Lochner, Kevin M., Wellman, Michael P.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: Washington, DC, USA IEEE Computer Society 19.07.2004
IEEE
Edice:ACM Conferences
Témata:
Applied computing > Law, social and behavioral sciences > Economics
Artificial intelligence
Business
Computing methodologies > Artificial intelligence > Knowledge representation and reasoning
Computing methodologies > Machine learning > Machine learning approaches > Rule learning
Consumer electronics
Internet
Laboratories
Permission
Space technology
Standardization
Surges
Technological innovation
ISBN:9781581138641, 1581138644
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Machine-readable specifications of auction mechanisms facilitate configurable implementation of computational markets, as well as standardization and formalization of the auction design space. We present an implemented rule-based scripting language for auctions, which provides constructs for specifying temporal control structure, while supporting orthogonal definition of mechanism policy parameters. Through a series of examples, we show how the language can capture much of the space of single-dimensional auctions, and can be extended to cover other novel designs.
Bibliografie:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9781581138641
1581138644
DOI:10.5555/1018410.1018833