Abstract
Given an unknown tournament over { 1 , … , n } , we show that the query complexity of the question “Is there a vertex with outdegree n − 1 ?” (known as a Condorcet winner in social choice theory) is exactly 2 n − ⌊ log ( n ) ⌋ − 2 . This stands in stark contrast to the evasiveness of this property in general digraphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
