Datasets:
midas
/
semeval2010_ke_tagged

Dataset card Viewer Files Community
text
stringlengths
0
32
to O
handle O
scenarios O
involving O
both O
hidden-information O
and O
hidden-action O
. O
Communication B-KEY
Complexity O
of O
Common O
Voting O
Rules O
* O
ABSTRACT O
We O
determine O
the O
communication B-KEY
complexity O
of O
the O
common O
voting O
rules O
. O
The O
rules O
-LRB- O
sorted O
by O
their O
communication B-KEY
complexity O
from O
low O
to O
high O
-RRB- O
are O
plurality O
, O
plurality O
with O
runoff O
, O
single O
transferable O
vote O
-LRB- O
STV O
-RRB- O
, O
Condorcet O
, O
approval O
, O
Bucklin O
, O
cup O
, O
maximin O
, O
Borda O
, O
Copeland O
, O
and O
ranked O
pairs O
. O
For O
each O
rule O
, O
we O
first O
give O
a O
deterministic O
communication B-KEY
protocol B-KEY
and O
an O
upper O
bound O
on O
the O
number O
of O
bits O
communicated B-KEY
in O
it O
; O
then O
, O