Randomness as a constraint

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

Some optimisation problems require a random-looking solution with no apparent patterns, for reasons of fairness, anonymity, undetectability or unpredictability. Randomised search is not a good general approach because problem constraints and objective functions may lead to solutions that are far from random.We propose a constraintbased approach to finding pseudo-random solutions, inspired by the Kolmogorov complexity definition of randomness and by data compression methods. Our “entropy constraints” can be implemented in constraint programming systems using well-known global constraints. We apply them to a problem from experimental psychology and to a factory inspection problem.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - 21st International Conference, CP 2015, Proceedings
EditorsGilles Pesant
PublisherSpringer Verlag
Pages351-366
Number of pages16
ISBN (Print)9783319232188
DOIs
Publication statusPublished - 2015
Externally publishedYes
Event21st International Conference on the Principles and Practice of Constraint Programming, CP 2015 - Cork, Ireland
Duration: 31 Aug 20154 Sep 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9255
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st International Conference on the Principles and Practice of Constraint Programming, CP 2015
Country/TerritoryIreland
CityCork
Period31/08/154/09/15

Fingerprint

Dive into the research topics of 'Randomness as a constraint'. Together they form a unique fingerprint.

Cite this