TBBL: A Tree-Based Bidding Language for Iterative Combinatorial Exchanges
Juda, Adam I.
MetadataShow full item record
CitationCavallo, 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.
AbstractWe 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.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:4031554
- FAS Scholarly Articles