TBBL: A Tree-Based Bidding Language for Iterative Combinatorial Exchanges

DSpace/Manakin Repository

TBBL: A Tree-Based Bidding Language for Iterative Combinatorial Exchanges

Citable link to this page


Title: TBBL: A Tree-Based Bidding Language for Iterative Combinatorial Exchanges
Author: Cavallo, Ruggiero; Parkes, David C.; Juda, Adam I.; Kirsch, Adam; Kulesza, Alex; Lahaie, Sébastien; Lubin, Benjamin; Michael, Loizos; Shneidman, Jeffery

Note: Order does not necessarily reflect citation order of authors.

Citation: Cavallo, Ruggiero, David C. Parkes, Adam I. Juda, Adam Kirsch, Alex Kulesza, Sébastien Lahaie, Benjamin Lubin, Loizos Michael, and Jeffery Shneidman. 2005. TBBL: A tree-based bidding language for iterative combinatorial exchanges. Paper presented at Multidisciplinary IJCAI-05 Workshop on Advances in Preference Handling in Edinburgh, Scotland, July 31 - August 1, 2005.
Full Text & Related Files:
Abstract: We present a novel tree-based logical bidding language, TBBL, for preference elicitation in combinatorial exchanges (CEs). TBBL provides new expressiveness for two-sided markets with agents that are both buying and selling goods. Moreover, the rich semantics of TBBL allow the language to capture new structure, making it exponentially more concise than OR* and LGB for preferences that are realistic in important domains for CEs. With simple extensions TBBL can subsume these earlier languages. TBBL can also explicitly represent partial information about valuations. The language is designed such that the structure in TBBL bids can be concisely captured directly in mixed-integer programs for the allocation problem. We illustrate TBBL through examples drawn from domains to which it can be (and is being) applied, and motivate further extensions we are currently pursuing.
Published Version: http://citeseerx.ist.psu.edu/viewdoc/download?doi=
Other Sources: http://www.eecs.harvard.edu/econcs/pubs/tbbl-ijcai05.pdf
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:4031554
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search