MétaCan
Menu
Back to cohort
Record W4252635693 · doi:10.22215/etd/2012-06773

Play patterns for path prediction in multiplayer online games

2012· dissertation· en· W4252635693 on OpenAlexafffund
Jacob Agar

Bibliographic record

Venuenot available
Typedissertation
Languageen
FieldComputer Science
TopicPeer-to-Peer Network Technologies
Canadian institutionsCarleton University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsDead reckoningComputer sciencePath (computing)Focus (optics)Position (finance)Set (abstract data type)Scheme (mathematics)Data miningComputer networkTelecommunicationsMathematics

Abstract

fetched live from OpenAlex

Traditional dead reckoning schemes predict an entity's position by assuming that an entity move with constant force or velocity. However, because much of entity move ment is rarely linear in nature, using linear prediction fails to produce an accurate result. Among existing dead reckoning methods, only few focus on improving pre diction accuracy via genuinely non-traditional methods for predicting the path of a player. Multiplayer Online Games (MOGs), a recent new type of Distributed Interac tive Simulation, have a large number of users. Providing accurate prediction results is crucial for quality of play, which is the ultimate goal to satisfy millions of online users. In this research, we propose a new prediction method based on play patterns involving the surrounding game state and objects of the player.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.808
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.020
GPT teacher head0.281
Teacher spread0.261 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designObservational
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2012
Admission routes2
Has abstractyes

Explore more

Same topicPeer-to-Peer Network TechnologiesFrench-language works237,207