On-line Chain Partitions of Up-growing Semi-orders

Details On-line Chain Partitions of Up-growing Semi-orders On-line Chain Partitions of Up-growing Semi-orders

2007-04-13

arxiv.org/abs/0704.1829v3

Computer Science

Discrete Mathematics

Scientific paper

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 $w$ is a minimum number $\fVal(w)$ such that Algorithm has a strategy using at most $\fVal(w)$ chains on orders of width at most $w$. 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 $\lfloor\frac{1+\sqrt{5}}{2}\; w \rfloor$.

Affiliated with

Also associated with

No associations

Rating

On-line Chain Partitions of Up-growing Semi-orders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On-line Chain Partitions of Up-growing Semi-orders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On-line Chain Partitions of Up-growing Semi-orders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-730376