<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01185565</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-17T19:49:40+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Dynamic Threshold Strategy for Universal Best Choice Problem</title>
            <author role="aut">
              <persName>
                <forename type="first">Jakub</forename>
                <surname>Kozik</surname>
              </persName>
              <idno type="halauthorid">500612-0</idno>
              <affiliation ref="#struct-235237"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Coordination</forename>
                <surname>Episciences Iam</surname>
              </persName>
              <email type="md5">ca50c40eb57b3ef14743f7aab97e8e68</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-08-20 16:32:01</date>
              <date type="whenModified">2025-03-12 12:20:03</date>
              <date type="whenReleased">2015-08-24 10:03:59</date>
              <date type="whenProduced">2010</date>
              <date type="whenEndEmbargoed">2015-08-20</date>
              <ref type="file" target="https://inria.hal.science/hal-01185565v1/document">
                <date notBefore="2015-08-20"/>
              </ref>
              <ref type="file" subtype="greenPublisher" n="1" target="https://inria.hal.science/hal-01185565v1/file/dmAM0131.pdf" id="file-1185565-1270566">
                <date notBefore="2015-08-20"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="201264">
                <persName>
                  <forename>Coordination</forename>
                  <surname>Episciences Iam</surname>
                </persName>
                <email type="md5">ca50c40eb57b3ef14743f7aab97e8e68</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01185565</idno>
            <idno type="halUri">https://inria.hal.science/hal-01185565</idno>
            <idno type="halBibtex">kozik:hal-01185565</idno>
            <idno type="halRefHtml">&lt;i&gt;21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)&lt;/i&gt;, 2010, Vienna, Austria. pp.439-452, &lt;a target="_blank" href="https://dx.doi.org/10.46298/dmtcs.2767"&gt;&amp;#x27E8;10.46298/dmtcs.2767&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.439-452, &amp;#x27E8;10.46298/dmtcs.2767&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1185565-1270566"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="DMTCS">DMTCS</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Dynamic Threshold Strategy for Universal Best Choice Problem</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jakub</forename>
                    <surname>Kozik</surname>
                  </persName>
                  <idno type="halauthorid">500612-0</idno>
                  <affiliation ref="#struct-235237"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">649</idno>
                <idno type="issn">1462-7264</idno>
                <idno type="eissn">1365-8050</idno>
                <title level="j">Discrete Mathematics and Theoretical Computer Science</title>
                <title level="m">Discrete Mathematics and Theoretical Computer Science (DMTCS)</title>
                <meeting>
                  <title>21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)</title>
                  <date type="start">2010</date>
                  <settlement>Vienna</settlement>
                  <country key="AT">Austria</country>
                </meeting>
                <editor>Drmota</editor>
                <editor>Michael and Gittenberger</editor>
                <editor>Bernhard</editor>
                <imprint>
                  <publisher>Discrete Mathematics and Theoretical Computer Science</publisher>
                  <publisher>DMTCS</publisher>
                  <biblScope unit="serie">DMTCS Proceedings</biblScope>
                  <biblScope unit="volume">DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)</biblScope>
                  <biblScope unit="pp">439-452</biblScope>
                  <date type="datePub">2010-01-01</date>
                </imprint>
              </monogr>
              <idno type="doi">10.46298/dmtcs.2767</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">best choice</term>
                <term xml:lang="en">secretary problem</term>
                <term xml:lang="en">partial order</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
              <classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</classCode>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halDomain" n="info.info-cg">Computer Science [cs]/Computational Geometry [cs.CG]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>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.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-235237" status="VALID">
          <orgName>Theoretical Computer Science Department [Krakow]</orgName>
          <orgName type="acronym">TCS</orgName>
          <desc>
            <address>
              <addrLine>Faculty of Mathematics and Computer Science, ul. Prof. Lojasiewicza 6, 30-348 Krakow, Poland</addrLine>
              <country key="PL"/>
            </address>
            <ref type="url">http://www.tcs.uj.edu.pl/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-303988" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-303988" status="VALID">
          <idno type="IdRef">026432250</idno>
          <orgName>Uniwersytet Jagielloński w Krakowie = Jagiellonian University = Université Jagellon de Cracovie</orgName>
          <orgName type="acronym">UJ</orgName>
          <date type="start">1364-01-01</date>
          <desc>
            <address>
              <addrLine>ul. Gołębia 24, 31-007 Kraków</addrLine>
              <country key="PL"/>
            </address>
            <ref type="url">https://www.uj.edu.pl</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>