Abstract

Multi-agent resource allocation is a growing area of research at the frontier between Economics and Computer Science. Despite the extensive theoretical work and raising number of practical applications, many fundamental problems in multi-agent resource allocation still require adequate attention to its computational aspects. This paper addresses computational aspects of multi-agent resource allocation through the use of a fully declarative and highly expressive logic programming paradigm -- Answer Set Programming -- to provide uniform, general and flexible solutions to many multi-agent resource allocation problems in a compact and declarative manner.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call