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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
