Add to ORKGABSTRACT We propose the use of logic-based preference representation languages based on weighted propositional formulas for specifying bids in a combinatorial auction. We then develop several heuristics for a branch-and-bound search algorithm for determining the winning bids in this framework and report on their empirical performance. The logic-based approach is attractive due to its high degree of flexibility in designing a range of different bidding languages within a single conceptual framework
We show that linear logic can serve as an expressive framework in which to model a rich va...
We show that linear logic can serve as an expressive framework in which to model a rich va...
We show that linear logic can serve as an expressive framework in which to model a rich va...
We propose the use of logic-based preference representation languages based on weighted propositiona...
A type of auctions that allows bidding on packages, or combinations, is called a combinatorial aucti...
AbstractCombinatorial auctions, that is, auctions where bidders can bid on combinations of items, te...
Combinatorial auctions provide a valuable mecha-nism for the allocation of goods in settings where b...
We introduce a new type of combinatorial auction that allows agents to bid for goods to buy, for goo...
We introduce a new type of combinatorial auction that allows agents to bid for goods to buy, for goo...
We show that linear logic can serve as an expressive framework in which to model a rich variety of c...
We show that linear logic can serve as an expressive framework in which to model a rich variety of ...
We show that linear logic can serve as an expressive framework in which to model a rich va...
Query learning models from computational learning theory (CLT) can be adopted to perform elicitation...
We show that linear logic can serve as an expressive framework in which to model a rich va...
Logic-based preference representation languages are used to represent utility functions in combinato...
We show that linear logic can serve as an expressive framework in which to model a rich va...
We show that linear logic can serve as an expressive framework in which to model a rich va...
We show that linear logic can serve as an expressive framework in which to model a rich va...
We propose the use of logic-based preference representation languages based on weighted propositiona...
A type of auctions that allows bidding on packages, or combinations, is called a combinatorial aucti...
AbstractCombinatorial auctions, that is, auctions where bidders can bid on combinations of items, te...
Combinatorial auctions provide a valuable mecha-nism for the allocation of goods in settings where b...
We introduce a new type of combinatorial auction that allows agents to bid for goods to buy, for goo...
We introduce a new type of combinatorial auction that allows agents to bid for goods to buy, for goo...
We show that linear logic can serve as an expressive framework in which to model a rich variety of c...
We show that linear logic can serve as an expressive framework in which to model a rich variety of ...
We show that linear logic can serve as an expressive framework in which to model a rich va...
Query learning models from computational learning theory (CLT) can be adopted to perform elicitation...
We show that linear logic can serve as an expressive framework in which to model a rich va...
Logic-based preference representation languages are used to represent utility functions in combinato...
We show that linear logic can serve as an expressive framework in which to model a rich va...
We show that linear logic can serve as an expressive framework in which to model a rich va...
We show that linear logic can serve as an expressive framework in which to model a rich va...