Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Event Scheduling
Distributed Constraint Optimization (DCOP) is an elegant formalism relevant to many areas in multiagent systems, yet complete algorithms have not been pursued for real world applications due to perceived complexity. To capably capture a rich class of complex problem domains, we introduce the Distrib...
Saved in:
Main Authors: | MAHESWARAN, Rajiv, Tambe, Milind, Bowring, Emma, Pearce, Jonathan, VARAKANTHAM, Pradeep |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2004
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/935 https://ink.library.smu.edu.sg/context/sis_research/article/1934/viewcontent/RealWorldDCOP.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Valuations of Possible States (VPS): A Unifying Quantitative Framework for Evaluating Privacy in Collaboration
by: MAHESWARAN, Rajiv T., et al.
Published: (2005) -
Privacy Loss in Distributed Constraint Reasoning: A Quantitative Framework for Analysis and Its Applications
by: MAHESWARAN, Rajiv, et al.
Published: (2006) -
Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems
by: YEOH, William, et al.
Published: (2011) -
Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems
by: YEOH, William, et al.
Published: (2015) -
Exploiting Belief Bounds: Practical POMDPs for Personal Assistant Agents
by: VARAKANTHAM, Pradeep, et al.
Published: (2005)