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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
