Declarative specification and solution of combinatorial auctions using logic programming

DOI10.1007/3-540-45402-0_14MaRDI QIDQ4798009zbMATH OpenFDO

Authors Cenk Uyan, Chitta Baral

Publication date 18 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2173/21730186.htm

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• A logic language for combinatorial optimization
• A sequential model of bargaining in logic programming
• scientific article; zbMATH DE number 2096830
• A hybrid approach of linear programming and logic modeling for the market core of sealed bid auctions
• The formalization of Vickrey auctions: a comparison of two approaches in Isabelle and Theorema
• scientific article; zbMATH DE number 1114457
• Solving combinatorial problems with a constraint functional logic language
• A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory

Cited in

(6)

• A hybrid approach of linear programming and logic modeling for the market core of sealed bid auctions
• A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory
• Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
• Unsatisfiable core analysis and aggregates for optimum stable model search
• Auction Description Language (ADL): General Framework for Representing Auction-Based Markets
• Block structured scheduling using constraint logic programming

Describes a project that uses

Uses Software

• Smodels

This page was built for publication: Declarative specification and solution of combinatorial auctions using logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798009)