On-line Chain Partitions of Up-growing Semi-orders
Discrete Mathematics
2011-02-22 v3
Abstract
On-line chain partition is a two-player game between Spoiler and Algorithm. Spoiler presents a partially ordered set, point by point. Algorithm assigns incoming points (immediately and irrevocably) to the chains which constitute a chain partition of the order. The value of the game for orders of width is a minimum number such that Algorithm has a strategy using at most chains on orders of width at most . We analyze the chain partition game for up-growing semi-orders. Surprisingly, the golden ratio comes into play and the value of the game is .
Keywords
Cite
@article{arxiv.0704.1829,
title = {On-line Chain Partitions of Up-growing Semi-orders},
author = {Stefan Felsner and Kamil Kloch and Grzegorz Matecki and Piotr Micek},
journal= {arXiv preprint arXiv:0704.1829},
year = {2011}
}