Sixth International Workshop on
DISTRIBUTED CONSTRAINT REASONING (DCR-05)
Final
program
Description
Distributed Constraint Reasoning (DCR) problems arise when pieces of
information about variables, constraints or both are relevant to
independent but communicating agents. They provide a promising
framework to deal with the increasingly diverse range of distributed
real world problems emerging from the evolution of computation and
communication technologies.
Distributed constraints satisfaction problems (DisCSPs) have been
studied
for over a decade. Due to the distributed nature of the problem, new
algorithmic techniques as well as concurrent measures of performance
have been developed. The current challenges posed by solving
Distributed
Constraint Reasoning Problems include designing new distributed search
algorithms for DisCSPs and Distributed Constraint Optimization
(DisCOP),
resource
restrictions (such as limits on time and communication), privacy
requirements, and exploring real world distributed applications for
DCR.
The goal of the DCR workshop series is to bring together researchers
from the many different areas that are relevant to distributed
constraint reasoning so that commonalities and relationships can be
discovered and understanding improved. As such, this workshop has
historically rotated its location between the three major conferences
in each of these areas: CP (2000, 2004), IJCAI (2001, 2003) and AAMAS
(2002). Building upon these previous successful workshops, we continue
in 2005, with the Sixth International DCR workshop
held in conjunction with IJCAI 2005 in Edinburgh.
The proceedings include 16 papers that are divided into four areas:
- Search algorithms on DisCSPs
- Applications of DisCSPs
- Privacy and
Security
- Distributed Optimization
Each of these areas has 4 or 5
papers that will be presented in a separate panel and are grouped
together in the proceedings. The first two papers in every panel are
longer presentations and the last 2-3 are shorter.
Two panels are planned in the morning
and two in the afternoon. The panel on Applications
of DisCSPs
has also an invited speaker and the extended abstract of the talk is
in that section of the proceedings. The Schedule of the workshop
includes links to the abstracts of all papers. The overall harvest of
papers is
very impressive for this young a field and I am grateful to all of the
authors and especially to the organizing and program committee, for
working hard to make this an interesting and fruitful workshop.
Finally,
a special personal thank you to Roie Zivan and Mayer Goldberg for
their help in organizing and putting together the proceedings.
Amnon Meisels (Workshop chair)
Program Committee
- Christian Bessiere, LIRMM-CNRS (bessiere@lirmm.fr)
- Boi Faltings, Swiss Federal Institute of Technology Lausanne
(boi.faltings@epfl.ch)
- Amnon Meisels, Ben-Gurion University (am@cs.bgu.ac.il)
- Pedro Meseguer, IIIA/CSIC (pedro@iiia.csic.es)
- Pragnesh Jay Modi, Carnegie Mellon University (pmodi@cs.cmu.edu)
- Makoto Yokoo, Kyushu University, Fukuoka, Japan
(yokoo@is.kyushu-u.ac.jp)
- Weixiong Zhang, Washington University (zhang@cs.wustl.edu)
Program
Morning sessions
Search algorithms on DisCSPs (9:00 - 10:30)
- Multi-Directional Distributed Searches with Aggregation. (9:00 -
9:15)
G. Ringwelski and Y. Hamadi abstract pdf
- Dynamic Ordering for Asynchronous Backtracking on DisCSPs. (9:20
- 9:35)
R. Zivan and A. Meisels abstract pdf
- Reducing Redundant Messages in the Asynchronous
Backtracking Algorithm. (9:40 - 9:50)
H. Jiang and J. M. Vidal abstract pdf
- Support-based Distributed Search. (10:00 - 10:10)
P. Harvey, C. F. Chang and A. Ghose abstract pdf
- Effects of Mediator Selection Strategies for Distributed
Constraint Satisfaction. (10:15 - 10:25)
M. Benish and N. Sadeh abstract pdf
Coffee Break
Applications of DisCSPs (11:00 - 12:00)
- Distributed Constraint Satisfaction applied to
Log-based Reconciliation. (11:00 - 11:15)
Y. L. Chong and Y. Hamadi abstract pdf
- A MultiAgent Architecture for Distributed Course Timetabling.
(11:20 - 11:35)
L. Di Gaspero, S. Mizzaro and A. Schaerf abstract pdf
- Distributed Meeting Schedule through Cooperative Mediation.
(11:40 - 11:50)
P. R. Ferreira and A. L. C. Bazzan abstract pdf
Invited talk (12:00 - 12:45)
Space Applications for Distributed Constraint Reasoning
B. J. Clement and A. C. Barrett abstract pdf
Afternoon sessions
Privacy and Security (14:00 - 15:00)
- Distributed Multi-Criteria Coordination: Privacy vs. Efficiency.
(14:00 - 14:15)
E. Bowring, M. Tambe and M. Yokoo abstract pdf
- The Distributed Stable Marriage Problem. (14:20 - 14:35)
I. Brito and P. Meseguer abstract pdf
- Asynchronous Backtracking for Asymmetric DisCSPs. (14:40 - 14:55)
R. Zivan and A. Meisels abstract pdf
Coffee Break
Privacy and Security (continued session) (15:30 - 16:00)
- Secure DisCSP Protocols - From Centralized Towards Distributed
Solutions. (15:30 - 15:40)
K. Nissim and R. Zivan abstract pdf
- Using secure DisCSP solvers for generalized vickrey auctions.
(15:45 - 15:55)
M. Silaghi abstract
pdf
Distributed Optimization (16:00 - 17:15)
- Escaping Local Optima with Penalties in Distributed Iterative
Improvement Search. (16:00 - 16:15)
M. Basharu, I. Arana and H. Ahriz abstract pdf
- Optimal Solution Stability in Real Time Optimization. (16:20 -
16:35)
A. Petcu and B. Faltings abstract pdf
- I mpact of Problem Centralization in Distributed COPs. (16:40 -
16:50)
J. Davin and P. J. Modi abstract pdf
- Networked Distributed POMDPs: DCOP-Inspired Distributed POMDPs.
(16:55 - 17:05)
R. Nair, P. Varakantham, M. Tambe and M. Yokoo abstract pdf