Neural regret-matching for distributed constraint optimization problems
Distributed constraint optimization problems (DCOPs) are a powerful model for multi-agent coordination and optimization, where information and controls are distributed among multiple agents by nature. Sampling-based algorithms are important incomplete techniques for solving medium-scale DCOPs. Howev...
Saved in:
Main Authors: | DENG, Yanchen, YU, Runshen, WANG, Xinrun, AN, Bo |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9142 https://ink.library.smu.edu.sg/context/sis_research/article/10145/viewcontent/Neural_Regret_Matching_pvoa.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Two agent-based approaches for solving multi-objective multi-constraint optimization problems
by: WANG HUI
Published: (2010) -
An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
by: Cheng, K.C.K., et al.
Published: (2013) -
Schedulers and redundancy for a class of constraint propagation rules
by: Brand, S., et al.
Published: (2013) -
Implementation and Applications of Ad Hoc Constraints
by: CHENG CHI KAN
Published: (2010) -
Erratum: P. van Beek and R. Dechter's theorem on constraint looseness and local consistency (Journal of the ACM)
by: Zhang, Y., et al.
Published: (2013)