1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.CC2021
Filling Crosswords is Very Hard
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis +1
We revisit a classical crossword filling puzzle which already appeared in Garey\&Jonhson's book. We are given a grid with vertical and horizontal slots and a dictionary with $m…
cs.GT2010★ 1 cited
Minimum regulation of uncoordinated matchings
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Due to the lack of coordination, it is unlikely that the selfish players of a strategic game reach a socially good state. A possible way to cope with selfishness is to compute a de…