activity
20162020
most citedLearning Interpretable Error Functions for Combinatorial Optimization Problem Modeling

3 citations · 5 across the 2 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2016★ 2 cited

Hanabi is NP-hard, Even for Cheaters who Look at Their Cards

Jean-Francois Baffier, Man-Kwun Chiu, Yago Diez +5

In this paper we study a cooperative card game called Hanabi from the viewpoint of algorithmic combinatorial game theory. In Hanabi, each card has one among colors and a number…