Constraint programming (CP) is a powerful programming paradigm for the declarativedescription and the e?ective solving of largecombinatorialproblems. Basedonastrongtheoreticalfoundation, itisincreasinglyattractingcommercial interest. Since the 1990s, CP has been deployed by many industry leaders, in particular to model heterogeneous optimization and satisfaction problems. - amples of application domains where such problems naturally arise, and where constraint programming has made a valuable contribution, are scheduling, p- duction planning, communication networks, routing, planning of...

Algorithmic decision theory is a new interdisciplinary research area that aims to bring together researchers from di?erent ?elds such as decision theory, d- crete mathematics, theoretical computer science and arti?cial intelligence, in order to improve decision support in the presence of massive databases, com- natorial structures, partial and/or uncertain information and distributed, p- sibly interoperating, decision makers. Such problems arise in several real-world decision-making scenarios such as humanitarian logistics, epidemiology, risk assessment and management, e-government,...