Software

References

Download

Original
ADOPT

P.J.
Modi, W. Shen, M. Tambe, M. Yokoo. “ADOPT:
Asynchronous distributed constraint optimization with quality
guarantees.” Artificial
Intelligence Journal(AIJ). 161:149–180, 2005
P.J.
Modi, W. Shen, M. Tambe, M. Yokoo. “ An
asynchronous complete method for distributed constraint optimization.” In
AAMAS, 2003.


ADOPT
with preprocessing and valued constraints (newest version of ADOPT)

S.
Ali, S. Koenig, M. Tambe. "Preprocessing
Techniques for Accelerating the DCOP Algorithm ADOPT.” In
AAMAS, 2005.
R.T.
Maheswaran, M. Tambe, E. Bowring, J.P. Pearce, P. Varakantham. “Taking
DCOP to the Real World : Efficient Complete Solutions for Distributed
Event Scheduling.”
In
AAMAS, 2004.


Multicriteria
ADOPT (MCA)

E.
Bowring, M. Tambe, M. Yokoo. "Multiply
Constrained Distributed Constraint Optimization” In
AAMAS, 2006.



K.
Mertens, and T. Holvoet, CSAA: A distributed ant algorithm framework
for constraint satisfaction, Proceedings of the 17th International
Florida Artificial Intelligence Research Society Conference (Barr, V.
and Markov, Z., eds.), pp. 764769, 2004 pdf ©
American Association for Artificial Intelligence ( FLAIRS
proceedings )


Original
MGM2

Implementation
of 2optimal algorithms in R.T. Maheswaran,
J.P. Pearce, and M. Tambe, "Distributed
Algorithms for DCOP: A GraphicalGameBased Approach," in
Proceedings of the 17th International Conference on Parallel and
Distributed Computing Systems (PDCS), San Francisco, CA, September
1517, 2004, pp. 432439.


Multicriteria MGM2 + Original
MGM2 (also includes [MC]MGM1) (Extended by Christopher Portway on top of
Zvi Topol's implementation)

Extention
of MGM2 (see above) to cover multiplyconstrained graphs,
specifically resourse and utility constraints. In a paper to appear
in Ninth
International
Workshop on Distributed Constraint Reasoning (DCR)
at CP07.


MGM3
and SCA3 (implemented by Zvi Topol)

New
3optimal algorithms based on 2optimal algorithms in R.T. Maheswaran,
J.P. Pearce, and M. Tambe, "Distributed
Algorithms for DCOP: A GraphicalGameBased Approach," in
Proceedings of the 17th International Conference on Parallel and
Distributed Computing Systems (PDCS), San Francisco, CA, September
1517, 2004, pp. 432439.


Asynchronous Simulation Toolkit (DALOk and DALOt).

Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, Milind Tambe. "Asynchronous Algorithms for Approximate Distributed Constraint Optimization with Quality Bounds" , In AAMAS, 2010.


Random Graph Generator with KOPT and TOPT Bound Solver

Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, Milind Tambe. "Asynchronous Algorithms for Approximate Distributed Constraint Optimization with Quality Bounds" , In AAMAS, 2010.


koptimal and toptimal bounds generator

This program (written in JAVA) can compute koptimal and toptimal bounds given a specific graph. It only outputs LP model file. So to solve it, you must have glpsol. It's an open source
LP solver which can be found here:
http://www.go.dlr.de/pdinfo_dv/glpk.html To start, you may look at LFPGenerator.java (which generates a bunch of random graphs and computes the average bound). 
Dataset

References

Download

Graph
coloring datasets

P.J.
Modi, W. Shen, M. Tambe, M. Yokoo. “ADOPT:
Asynchronous distributed constraint optimization with quality
guarantees.” Artificial
Intelligence Journal(AIJ). 161:149–180, 2005
P.J.
Modi, W. Shen, M. Tambe, M. Yokoo. “An
asynchronous complete method for distributed constraint optimization.” In
AAMAS, 2003.


Sensor
net and graph coloring datasets

S.
Ali, S. Koenig, M. Tambe, “Preprocessing
techniques for accelerating the DCOP algorithm ADOPT.” In
AAMAS, 2005.


Meeting
scheduling and sensor net datasets

R.T.
Maheswaran, M. Tambe, E. Bowring, J.P. Pearce, P. Varakantham, “Taking
DCOP to the real world: efficient complete solutions for distributed
event scheduling.”
In
AAMAS, 2004.


Graph
coloring, randomized, and highstakes UAV datasets

R.T.
Maheswaran, J.P. Pearce, M. Tambe. “Distributed
algorithms for DCOP: a graphicalgamebased approach.” In
PDCS, 2004.


MCDCOP Graph Coloring Datasets

R.T.
Maheswaran, J.P. Pearce, M. Tambe. “On KOptimal Distributed Constraint Optimization Algorithms: New Bounds and Algorithms” In
AAMAS, 2008.

References

Manish Jain, Matthew Taylor, Milind Tambe, Makoto Yokoo. “DCOPs Meet the RealWorld: Exploring Unknown Reward Matrices with Applications to Mobile Sensor Networks” In
International Joint Conference on Artificial Intelligence (IJCAI), 2009.
Matthew E. Taylor, Manish Jain, Prateek Tandon, Milind Tambe. “Using DCOPs to Balance Exploration and Exploitation in TimeCritical Domains” In Proceedings of the IJCAI 2009 Workshop on Distributed Constraint Reasoning (DCR 2009).
Matthew E. Taylor, Manish Jain, Yanquin Jin, Makoto Yooko, and Milind Tambe. “When Should There be a “Me” in “Team”? Distributed MultiAgent Optimization Under Uncertainty” In
International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2010.
Supplemental Material

SoftwareDCEE Python Simulator Code, Version 0.9. 2/5/2010 
Document

Download

Adopt
presentation slides by Jay Modi


Adopt
FAQ by Jay Modi


Results
from S. Ali, S. Koenig, M. Tambe. “Preprocessing
techniques for accelerating the DCOP algorithm ADOPT.” In
AAMAS, 2005.
