ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

May a weak tennis player win?

Oleksandr Sivak (2016) May a weak tennis player win?. EngD thesis.

Download (596Kb)


    The winner of a competition depends on the choice of actual matches played. We assume that each match is played between two players. Our goal is to examine which players can be made winners of a competition if we know any match result in advance. We only consider competitions in which the winner of a single match progresses to the next round and the loser leaves the competition. We focus on tennis competitions and use real data downloaded from atpworldtour.com. The final winner of a competition depends on the choice of matches in the first round — we call it a bracket. We would like to determine possible competition winners and for every winner π construct an appropriate bracket in which π is the winner. Apart from that we also study how tight are the sufficient conditions for a player to become a winner, as described in the paper Fixing a Tournament (Williams, AAAI 2010). For instance, one of our results is that a player whose relative rank is between 1 and 36 can with high probability be made a winner in a competition of 64 players.

    Item Type: Thesis (EngD thesis)
    Keywords: competition manipulation, fixing a tournament, tennis, fair deterministic winner, weak winners, weak players
    Number of Pages: 39
    Language of Content: English
    Mentor / Comentors:
    Name and SurnameIDFunction
    izr. prof. dr. Gašper Fijavž246Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536903619)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 3321
    Date Deposited: 14 Apr 2016 16:09
    Last Modified: 06 May 2016 10:41
    URI: http://eprints.fri.uni-lj.si/id/eprint/3321

    Actions (login required)

    View Item