Probabilistic strategies for the partition and plurality problems

DOI10.1002/rsa.20148zbMath1281.91008OpenAlexW4235418153WikidataQ57601521 ScholiaQ57601521MaRDI QIDQ3419612

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

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)

Related Items (9)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• STACS 2004
• Mathematical Foundations of Computer Science 2003
• STACS 2005
• Computing and Combinatorics

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