The best choice problem for posets; colored complete binary trees

Wojciech Kaźmierczak ()
Additional contact information
Wojciech Kaźmierczak: Wrocław University of Technology

Journal of Combinatorial Optimization, 2016, vol. 31, issue 1, No 2, 13-28

Abstract: Abstract We consider the poset version of the secretary problem for rooted complete binary trees of a given length n where the $$2^{n-a}$$ 2 n - a complete binary trees whose roots are at the level $$a+1$$ a + 1 (counting from the leaves) are colored with different colors visible to the selector and the vertices above level $$a+1$$ a + 1 are colored in a natural way according to the vertices below them that came earlier. We find an optimal stopping time for two-colored trees and near optimal strategies for more than two colors.

Keywords: Secretary problem; Best choice; Partial order (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9705-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:1:d:10.1007_s10878-014-9705-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9705-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().