Reputation
573
Top tag
Next privilege 1,000 Rep.
Create new tags
Badges
5 22
Impact
~26k people reached

  • 0 posts edited
  • 2 helpful flags
  • 19 votes cast
Sep
24
awarded  Popular Question
Aug
20
awarded  Notable Question
Jul
9
asked Clarification about solution of linear SVM problem
Jul
9
accepted online estimation of autoregressive process
Jul
9
accepted Puzzle about voting
Jul
9
accepted Time series and social network analysis
Jul
2
awarded  Curious
Jul
2
awarded  Inquisitive
May
9
awarded  Popular Question
Apr
18
awarded  Yearling
Feb
6
awarded  Popular Question
Jan
28
awarded  Popular Question
Oct
3
revised Puzzle about voting
edited title
Oct
3
comment Puzzle about voting
Hi Ross. I'm not sure I understood the conclusion. If votes are binary and $L>2$, the leaders cannot all disagree. Since decisions are binary, you will always find at least one couple agreeing on something isn't it? Here, I am assuming the leaders are independent and pick their vote at random.
Oct
3
revised Puzzle about voting
edited tags
Oct
3
revised Puzzle about voting
added 4 characters in body
Oct
3
comment Puzzle about voting
the tough part is when $L>1$ :)
Oct
3
asked Puzzle about voting
Sep
2
awarded  Popular Question
Apr
18
awarded  Yearling