Name
Title | ||
|---|---|---|
Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming |
Abstract | ||
|---|---|---|
In a combinatorial auction problem bidders are allowed to bid on a bundle of items. The auctioneer has to select a subset of the bids so as to maximize the price it gets, and of course making sure that it does not accept multiple bids that have the same item as each item can be sold only once. In this paper we show how the combinatorial auction problem and many of its extensions can be expressed in logic programming based systems such as Smodels and dlv. We propose this as an alternative to the standard syntax specific specialized implementations that are much harder to modify and extend when faced with generalizations and additional constraints. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-45402-0_14 | LPNMR |
Keywords | Field | DocType |
combinatorial auction problem bidder,combinatorial auctions,syntax specific specialized implementation,multiple bid,logic programming,additional constraint,declarative specification,combinatorial auction problem,real estate,combinatorial auction,profitability | Knowledge representation and reasoning,Computer science,Combinatorial auction,Algorithm,Implementation,Combinatorial optimization,Theoretical computer science,Vickrey–Clarke–Groves auction,Non-monotonic logic,Logic programming,Bidding | Conference |
ISBN | Citations | PageRank |
3-540-42593-4 | 17 | 0.66 |
References | Authors | |
14 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chitta Baral | 1 | 2353 | 269.58 |
| Cenk Uyan | 2 | 17 | 0.66 |