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

DSpace/Manakin Repository

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

Show simple item record

dc.contributor.author Cavallo, Ruggiero
dc.contributor.author Parkes, David C.
dc.contributor.author Juda, Adam I.
dc.contributor.author Kirsch, Adam
dc.contributor.author Kulesza, Alex
dc.contributor.author Lahaie, Sébastien
dc.contributor.author Lubin, Benjamin
dc.contributor.author Michael, Loizos
dc.contributor.author Shneidman, Jeffery
dc.date.accessioned 2010-04-30T14:07:06Z
dc.date.issued 2005
dc.identifier.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. en_US
dc.identifier.uri http://nrs.harvard.edu/urn-3:HUL.InstRepos:4031554
dc.description.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. en_US
dc.description.sponsorship Engineering and Applied Sciences en_US
dc.language.iso en_US en_US
dc.relation.isversionof http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.60.1872&rep=rep1&type=pdf#page=49 en_US
dc.relation.hasversion http://www.eecs.harvard.edu/econcs/pubs/tbbl-ijcai05.pdf en_US
dash.license LAA
dc.title TBBL: A Tree-Based Bidding Language for Iterative Combinatorial Exchanges en_US
dc.type Conference Paper en_US
dc.description.version Accepted Manuscript en_US
dc.relation.journal Multidisciplinary Workshop on Advances in Preference Handling en_US
dash.depositing.author Parkes, David C.
dc.date.available 2010-04-30T14:07:06Z

Files in this item

Files Size Format View
Cavallo_TBBL.pdf 112.2Kb PDF View/Open

This item appears in the following Collection(s)

  • FAS Scholarly Articles [7585]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University

Show simple item record

 
 

Search DASH


Advanced Search
 
 

Submitters