Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Dynamic Threshold St ...
Conference paper

Dynamic Threshold Strategy for Universal Best Choice Problem

Jakub Kozik (1)
(1) Theoretical Computer Science Department [Krakow]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2009
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
Proceedings
DOI
10.46298/dmtcs.2767
License
https://about.hal.science/hal-authorisation-v1
Indicators
576
Views
654
Downloads

Dynamic Threshold Strategy for Universal Best Choice Problem

Jakub Kozik (1)
(1) Theoretical Computer Science Department [Krakow]
Abstract
We propose a new strategy for universal best choice problem for partially ordered sets. We present its partial analysis which is sufficient to prove that the probability of success with this strategy is asymptotically strictly greater than 1/4, which is the value of the best universal strategy known so far.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • partial order
  • secretary problem
  • best choice
Cited by

Source: OpenCitations

  • Maximizing the expected number of components in an online search of a graph

    arXiv (Cornell University)

    Authors : Fabrício Siqueira Benevides ORCID, Małgorzata Sulkowska ORCID

    Journal reference : Volume 345, 2021, pp. 112668

    DOI : 10.1016/j.disc.2021.112668

  • Partially ordered secretaries

    Electronic Communications in Probability

    Authors : Ragnar Freij ORCID, Johan Wästlund

    Journal reference : Volume 15, 2010, pp.

    DOI : 10.1214/ecp.v15-1579

  • The secretary problem on an unknown poset

    arXiv (Cornell University)

    Authors : Bryn Garrod, Robert Morris ORCID

    Journal reference : Volume 43, 2012, pp. 429-451

    DOI : 10.1002/rsa.20466

  • The best choice problem for a union of two linear orders with common maximum

    Discrete Applied Mathematics

    Authors : Wojciech Kaźmierczak ORCID

    Journal reference : Volume 161, 2013, pp. 3090-3096

    DOI : 10.1016/j.dam.2013.06.026

  • The best choice problem for upward directed graphs

    Discrete Optimization

    Authors : Małgorzata Sulkowska ORCID

    Journal reference : Volume 9, 2012, pp. 200-204

    DOI : 10.1016/j.disopt.2012.04.001
Preview
Loading PDF preview...