Stochastic dominance in stochastic DCOPs for risk-sensitive applications
Distributed constraint optimization problems (DCOPs) are well-suited for modeling multi-agent coordination problems where the primary interactions are between local subsets of agents. However, one limitation of DCOPs is the assumption that the constraint rewards are without uncertainty. Researchers...
Saved in:
Main Authors: | NGUYEN DUC THIEN, YEOH, William, LAU, Hoong Chuin |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2012
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3370 https://ink.library.smu.edu.sg/context/sis_research/article/4372/viewcontent/StochasticDominanceDCOP.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Distributed Gibbs: A memory-bounded sampling-based DCOP algorithm
by: NGUYEN, Duc Thien, et al.
Published: (2013) -
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) -
Dynamic Stochastic Orienteering Problems for Risk-Aware Applications
by: LAU, Hoong Chuin, et al.
Published: (2012)