Probabilistic strategies for the partition and plurality problems

DOI10.1002/RSA.20148MaRDI QIDQ3419612zbMATH OpenOpenAlexWikidataFDO

Authors Zdeněk Dvořák, Vít Jelínek, Jan Kynčl, Daniel Král', Michael Saks

Publication date 7 February 2007

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20148

Mathematics Subject Classification ID

2-person games (91A05) Probabilistic games; gambling (91A60)

Recommendations

• STACS 2005
• Randomized strategies for the plurality problem
• STACS 2004
• The plurality problem with three colors and more.
• A plurality problem with three colors and query size three

Cites work

• Computing and Combinatorics
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 1151379 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003
• STACS 2004
• STACS 2005

Cited in

(12)

• Randomized strategies for the plurality problem
• Majority problems of large query size
• From discrepancy to majority
• A plurality problem with three colors and query size three
• Oblivious and adaptive strategies for the majority and plurality problems
• Computing majority via multiple queries
• Finding a majority ball with majority answers
• Finding a non-minority ball with majority answers
• Searching for majority with k-tuple queries
• STACS 2004
• STACS 2005
• Computing majority with triple queries

This page was built for publication: Probabilistic strategies for the partition and plurality problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3419612)