izpis_h1_title_alt

Podaljšana igra v tenisu in Laplaceov demon : diplomsko delo
ID Vehovar, Miha (Author), ID Škulj, Damjan (Mentor) More about this mentor... This link opens in a new window, ID Matjašič, Miha (Co-mentor)

.pdfPDF - Presentation file, Download (628,10 KB)
MD5: C7D593F9B42DFBEF4FEAB5A22141BC1B

Abstract
Napovedovanje izida teniške igre v živo je znanstveno in špekulativno aktualno zgolj zadnjih nekaj desetletij. Trenutni modeli takšnega napovedovanja v znanstveni literaturi temeljijo na verjetnosti, da igralec na servisu doseže točko, to verjetnost pa se izračuna že pred začetkom tekme. V literaturi je za takšno napovedovanje najpogosteje uporabljen model markovskih verig, ki predpostavlja, da so prihodnje verjetnosti dogodkov odvisne zgolj od trenutnih stanj in ne od celotne zgodovine rezultata. V diplomskem delu zasnujemo metodo, ki obravnava podaljšano igro, to je trinajsto igro seta. Ta metoda se od obstoječih modelov napovedovanja izida teniške igre razlikuje v dveh temeljnih lastnostih. Prva lastnost naše metode je, da se ne osredotoča na verjetnost, da igralec na servisu doseže točko, kot na osrednjo spremenljivko modela. Druga lastnost naše metode je, da v našem modelu ne predpostavljamo markovske lastnosti, ki pomeni nespominskost procesa (ang. memorylessness), saj želimo pokazati, da na trenutno verjetnost izida vplivajo prav vsa predhodna stanja in ne zgolj trenutno stanje rezultata, kakor to predpostavlja model markovskih verig. S tem postane celota vseh predhodnih stanj naša osrednja spremenljivka, s katero napovedujemo izid. S testom ANOVA tako pokažemo, da so verjetnosti napovedovanja izida podaljšane igre odvisne od celotne zgodovine zaporedja točk in ne zgolj od predhodnega stanja. V diplomskem delu pokažemo tudi, da v podaljšani igri tenisa lahko obstajajo takšne točke, ki za napovedovanje izida teniške tekme nosijo znatno večjo napovedno vrednost od vseh preostalih točk in za katere lahko teoretiziramo njihovo deterministično naravo.

Language:Slovenian
Keywords:tenis, podaljšana igra, modeliranje tenisa v živo, determinizem
Work type:Bachelor thesis/paper
Typology:2.11 - Undergraduate Thesis
Organization:FDV - Faculty of Social Sciences
Place of publishing:Ljubljana
Publisher:[M. Vehovar]
Year:2020
Number of pages:42 str.
PID:20.500.12556/RUL-114390 This link opens in a new window
UDC:303(043.3)
COBISS.SI-ID:36643421 This link opens in a new window
Publication date in RUL:26.02.2020
Views:965
Downloads:229
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Title:Tie break in tennis and Laplace's demon
Abstract:
Modelling of in-play tennis match has been scientifically and speculatively more thoroughly studied only during the last few decades. Most of temporary methods in scientific literature are founded on the probability that a serving player wins a point. These probabilities are most often calculated before the very beginning of the match. This leads to a Markov chain model, which assumes that the future states only depend on the current state and not on the result history. In this thesis, we design a method not assuming the Markov property, which sets the process to be memoryless. Our method therefore calculates the probabilities beyond a-priori given probabilities of the serving player achieving a point. We exemplify this method on tie break, the thirteenth game of a set. Using ANOVA test, we show that the probabilities of predicting the outcome of a tie break game depend on the complete result sequences and not only on the summarized result. We also show that in tie break there are result points that have much higher predictive value for the tie break winner than other result points to the degree where probabilities could possibly be replaced by certainty.

Keywords:tennis, tie break, in-play modelling of tennis, determinism

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back