On a universal best choice algorithm for partially ordered sets

  • Authors:

  • Nicholas Georgiou;Małgorzata Kuchta;Michał Morayne;Jarosław Niemiec

  • Affiliations:

  • Department of Mathematics, University of Bristol, University Walk, Bristol, BS8 1TW, UK;Institute of Mathematics and Computer Science, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, POLAND;Institute of Mathematics and Computer Science, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, POLAND;Institute of Mathematics and Computer Science, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, POLAND

  • Venue:
  • Random Structures & Algorithms
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lower bound of its chance of success from the hitherto known constant 1-8 to 1-4. We also show that this result is the best possible for this algorithm, i.e., the 1-4 bound cannot be further improved. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008