no code implementations • 19 Jan 2024 • Ben Aoki-Sherwood, Catherine Bregou, David Liben-Nowell, Kiran Tomlinson, Thomas Zeng
We consider a natural extension of consider-then-choose models to a top-$k$ ranking setting, where we assume rankings are constructed according to a Plackett-Luce model after sampling a consideration set.
no code implementations • NeurIPS 2011 • Flavio Chierichetti, David Liben-Nowell, Jon M. Kleinberg
There is a tree T that we cannot observe directly (representing the structure along which the information has spread), and certain nodes randomly decide to make their copy of the information public.
2 code implementations • 21 Oct 2002 • Erik D. Demaine, Susan Hohenberger, David Liben-Nowell
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configuration of filled squares; any completely filled row of the gameboard is cleared and all pieces above it drop by one row.
Computational Complexity Computational Geometry Discrete Mathematics F.1.3; F.2.2; G.2.1; K.8.0
