Document Open Access Logo

Explaining Propagation for Gini and Spread with Variable Mean

Authors Alexander Ek , Andreas Schutt , Peter J. Stuckey , Guido Tack

Thumbnail PDF


  • Filesize: 0.89 MB
  • 16 pages

Document Identifiers

Author Details

Alexander Ek
  • Dept. of Data Science & AI, Monash University, Melbourne, Australia
  • CSIRO Data61, Melbourne, Australia
Andreas Schutt
  • CSIRO Data61, Melbourne, Australia
Peter J. Stuckey
  • Dept. of Data Science & AI, Monash University, Melbourne, Australia
Guido Tack
  • Dept. of Data Science & AI, Monash University, Melbourne, Australia

Cite AsGet BibTex

Alexander Ek, Andreas Schutt, Peter J. Stuckey, and Guido Tack. Explaining Propagation for Gini and Spread with Variable Mean. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 21:1-21:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)


In optimisation problems involving multiple agents (stakeholders) we often want to make sure that the solution is balanced and fair. That is, we want to maximise total utility subject to an upper bound on the statistical dispersion (e.g., spread or the Gini coefficient) of the utility given to different agents, or minimise dispersion subject to some lower bounds on utility. These needs arise in, for example, balancing tardiness in scheduling, unwanted shifts in rostering, and desired resources in resource allocation, or minimising deviation from a baseline in schedule repair, to name a few. These problems are often quite challenging. To solve them efficiently we want to effectively reason about dispersion. Previous work has studied the case where the mean is fixed, but this may not be possible for many problems, e.g., scheduling where total utility depends on the final schedule. In this paper we introduce two log-linear-time dispersion propagators - (a) spread (variance, and indirectly standard deviation) and (b) the Gini coefficient - capable of explaining their propagations, thus allowing effective clause learning solvers to be applied to these problems. Propagators for (a) exist in the literature but do not explain themselves, while propagators for (b) have not been previously studied. We avoid introducing floating-point variables, which are usually not supported by learning solvers, by reasoning about scaled, integer versions of the constraints. We show through experimentation that clause learning can substantially improve the solving of problems where we want to bound dispersion and optimise total utility and vice versa.

Subject Classification

ACM Subject Classification
  • Computing methodologies → Artificial intelligence
  • Theory of computation → Constraint and logic programming
  • Spread constraint
  • Gini index
  • Filtering algorithm
  • Constraint programming
  • Lazy clause generation


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Christian Bessiere, Emmanuel Hebrard, George Katsirelos, Zeynep Kiziltan, Émilie Picard-Cantin, Claude-Guy Quimper, and Toby Walsh. The balance constraint family. In Barry O'Sullivan, editor, CP'14, pages 174-189. Springer, 2014. Google Scholar
  2. Alessio Bonfietti and Michele Lombardi. The weighted average constraint. In Michela Milano, editor, CP'12, pages 191-206. Springer, 2012. Google Scholar
  3. Geoffrey Chu. Improving Combinatorial Optimization. PhD thesis, Department of Computing and Information Systems, University of Melbourne, Australia, 2011. Google Scholar
  4. Philip M. Dixon, Jacob Weiner, Thomas Mitchell-Olds, and Robert A. Woodley. Bootstrapping the Gini coefficient of inequality. Ecology, 68:1548-1551, 1987. (Erratum in Ecology, 69:1307, 1987). Google Scholar
  5. Joseph L Gastwirth. The estimation of the Lorenz curve and Gini index. The review of economics and statistics, pages 306-316, 1972. Google Scholar
  6. Farhad Mehran. Bounds on the Gini index based on observed points of the Lorenz curve. Journal of the American Statistical Association, 70(349):64-66, 1975. Google Scholar
  7. Jean-Noël Monette, Nicolas Beldiceanu, Pierre Flener, and Justin Pearson. A parametric propagator for pairs of sum constraints with a discrete convexity property. AIJ, 241:170-190, December 2016. URL:
  8. Nicholas Nethercote, Peter J. Stuckey, Ralph Becket, Sebastian Brand, Gregory J. Duck, and Guido Tack. MiniZinc: Towards a standard CP modelling language. In CP'07, LNCS 4741, pages 529-543. Springer, 2007. Google Scholar
  9. Olga Ohrimenko, Peter Stuckey, and Michael Codish. Propagation via lazy clause generation. Constraints, 14:357-391, 2009. Google Scholar
  10. Philippe Olivier, Andrea Lodi, and Gilles Pesant. Measures of balance in combinatorial optimization. 4OR, June 2021. URL:
  11. Guillaume Perez and Jean-Charles Régin. MDDs are efficient modeling tools: An application to some statistical constraints. In Domenico Salvagnin and Michele Lombardi, editors, CPAIOR'17, pages 30-40. Springer, 2017. Google Scholar
  12. Gilles Pesant. Achieving domain consistency and counting solutions for dispersion constraints. INFORMS J. Comput., 27(4):690-703, 2015. URL:
  13. Gilles Pesant and Jean-Charles Régin. SPREAD: A balancing constraint based on statistics. In Peter van Beek, editor, CP'05, LNCS 3709, pages 460-474. Springer, 2005. URL:
  14. Francesca Rossi, Peter van Beek, and Toby Walsh, editors. Handbook of Constraint Programming. Elsevier, 2006. Google Scholar
  15. Roberto Rossi, Özgür Akgün, Steven Prestwich, and S. Armagan Tarim. Declarative statistics, 2017. URL:
  16. Pierre Schaus, Yves Deville, and Pierre Dupont. Bound-consistent deviation constraint. In Christian Bessière, editor, CP'07, pages 620-634. Springer, 2007. Google Scholar
  17. Pierre Schaus and Jean-Charles Régin. Bound-consistent spread constraint. EURO J. Comput. Optim., 2(3):123-146, 2014. URL:
  18. Eric Taillard. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2):278-285, 1993. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail