Distributed Gibbs: A memory-bounded sampling-based DCOP algorithm
Researchers have used distributed constraint optimization problems (DCOPs) to model various multi-agent coordination and resource allocation problems. Very recently, Ottens et al. proposed a promising new approach to solve DCOPs that is based on confidence bounds via their Distributed UCT (DUCT) sam...
Saved in:
Main Authors: | NGUYEN, Duc Thien, YEOH, William, LAU, Hoong Chuin |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2013
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1656 https://ink.library.smu.edu.sg/context/sis_research/article/2655/viewcontent/aamas13_dgibbs.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Stochastic dominance in stochastic DCOPs for risk-sensitive applications
by: NGUYEN DUC THIEN,, et al.
Published: (2012) -
Distributed Gibbs: A linear-space sampling-based DCOP algorithm
by: NGUYEN, Duc Thien, et al.
Published: (2019) -
Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems
by: YEOH, William, et al.
Published: (2015) -
Decentralized multi-agent reinforcement learning in average-reward dynamic DCOPs
by: NGUYEN, Duc Thien, et al.
Published: (2014) -
Decentralized multi-agent reinforcement learning in average-reward dynamic DCOPs
by: Nguyen, Duc Thien, et al.
Published: (2014)