A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
How to Play the Majority Game with Liars
[chapter]
Algorithmic Aspects in Information and Management
The Majority game is played by a questioner (Q) and an answerer (A). A holds n elements, each of which can be labeled as 0 or 1. Q is trying to identify some element A holds as having the majority label or in the case of a tie claim there is none. To do this Q asks questions comparing whether two elements have the same or different label. Q's goal is to ask as few questions as possible while A's goal is to delay Q as much as possible. Let q * denote the minimal number of questions needed for Q
doi:10.1007/978-3-540-72870-2_21
dblp:conf/aaim/ButlerMG07
fatcat:ycu73kvxxvfhth7ocm2udiamdi