Declarative specification and solution of combinatorial auctions using logic programming

Chitta Baral; Cenk Uyan

doi:10.1007/3-540-45402-0_14

Declarative specification and solution of combinatorial auctions using logic programming

Chitta Baral, Cenk Uyan

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

31 Scopus citations

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.

Original language	English (US)
Title of host publication	Logic Programming and Nonmonotonic Reasoning - 6th International Conference, LPNMR 2001, Proceedings
Pages	186-199
Number of pages	14
DOIs	https://doi.org/10.1007/3-540-45402-0_14
State	Published - Dec 1 2001
Event	6th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2001 - Vienna, Austria Duration: Sep 17 2001 → Sep 19 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2173 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	6th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2001
Country/Territory	Austria
City	Vienna
Period	9/17/01 → 9/19/01

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-45402-0_14

Cite this

Baral, C., & Uyan, C. (2001). Declarative specification and solution of combinatorial auctions using logic programming. In Logic Programming and Nonmonotonic Reasoning - 6th International Conference, LPNMR 2001, Proceedings (pp. 186-199). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2173 LNAI). https://doi.org/10.1007/3-540-45402-0_14

Declarative specification and solution of combinatorial auctions using logic programming. / Baral, Chitta; Uyan, Cenk.
Logic Programming and Nonmonotonic Reasoning - 6th International Conference, LPNMR 2001, Proceedings. 2001. p. 186-199 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2173 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Baral, C & Uyan, C 2001, Declarative specification and solution of combinatorial auctions using logic programming. in Logic Programming and Nonmonotonic Reasoning - 6th International Conference, LPNMR 2001, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2173 LNAI, pp. 186-199, 6th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2001, Vienna, Austria, 9/17/01. https://doi.org/10.1007/3-540-45402-0_14

Baral C, Uyan C. Declarative specification and solution of combinatorial auctions using logic programming. In Logic Programming and Nonmonotonic Reasoning - 6th International Conference, LPNMR 2001, Proceedings. 2001. p. 186-199. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45402-0_14

Baral, Chitta ; Uyan, Cenk. / Declarative specification and solution of combinatorial auctions using logic programming. Logic Programming and Nonmonotonic Reasoning - 6th International Conference, LPNMR 2001, Proceedings. 2001. pp. 186-199 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{059b1a1fc6724d43b7150c63876cc618,

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.",

author = "Chitta Baral and Cenk Uyan",

year = "2001",

month = dec,

day = "1",

doi = "10.1007/3-540-45402-0_14",

language = "English (US)",

isbn = "3540425934",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "186--199",

booktitle = "Logic Programming and Nonmonotonic Reasoning - 6th International Conference, LPNMR 2001, Proceedings",

note = "6th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2001 ; Conference date: 17-09-2001 Through 19-09-2001",

}

TY - GEN

T1 - Declarative specification and solution of combinatorial auctions using logic programming

AU - Baral, Chitta

AU - Uyan, Cenk

PY - 2001/12/1

Y1 - 2001/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79955747988&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955747988&partnerID=8YFLogxK

U2 - 10.1007/3-540-45402-0_14

DO - 10.1007/3-540-45402-0_14

M3 - Conference contribution

AN - SCOPUS:79955747988

SN - 3540425934

SN - 9783540425939

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 186

EP - 199

BT - Logic Programming and Nonmonotonic Reasoning - 6th International Conference, LPNMR 2001, Proceedings

T2 - 6th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2001

Y2 - 17 September 2001 through 19 September 2001

ER -

Declarative specification and solution of combinatorial auctions using logic programming

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this