Back to Search Start Over

How to Play the Majority Game with Liars.

Authors :
Hutchison, David
Kanade, Takeo
Kittler, Josef
Kleinberg, Jon M.
Mattern, Friedemann
Mitchell, John C.
Naor, Moni
Nierstrasz, Oscar
Rangan, C. Pandu
Steffen, Bernhard
Sudan, Madhu
Terzopoulos, Demetri
Tygar, Doug
Vardi, Moshe Y.
Weikum, Gerhard
Ming-Yang Kao
Xiang-Yang Li
Butler, Steve
Jia Mao
Graham, Ron
Source :
Algorithmic Aspects in Information & Management (9783540728689); 2007, p221-230, 10p
Publication Year :
2007

Abstract

The Majority game is a two player game with a questioner Q and an answerer A. The answerer holds n elements, each of which can be labeled as 0 or 1. The questioner can ask questions comparing whether two elements have the same or different label. The goal for the questioner is to ask as few questions as possible to be able to identify a single element which has a majority label, or in the case of a tie claim there is none. We denote the minimum number of questions Q needs to make, regardless of A's answers, as q*. In this paper we consider a variation of the Majority game where A is allowed to lie up to t times, i.e., Q needs to find an error-tolerant strategy. In this paper we will give upper and lower bounds for q* for an adaptive game (where questions are processed one at a time), and will find q* for an oblivious game (where questions are asked in one batch). [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISBNs :
9783540728689
Database :
Supplemental Index
Journal :
Algorithmic Aspects in Information & Management (9783540728689)
Publication Type :
Book
Accession number :
33100138
Full Text :
https://doi.org/10.1007/978-3-540-72870-2_21