Fair enough. But, in my experience, most issues that cause deadlock reduce to binary decisions - in which case having an odd number of deciders is sufficient.

If you have to account for n-ary decisions, then you can never be to guaranteed to be free from deadlock no matter how many deciders you have (trivially, consider the case where n equals the number of deciders).