MétaCan
Menu
Back to cohort
Record W2119865281 · doi:10.26503/dl.v2005i1.154

Bringing New HOPE to Networked Games: Using Optimistic Execution to Improve Quality of Service

2005· article· en· W2119865281 on OpenAlexaff
Ryan Hanna, Michael Katchabaw

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPeer-to-Peer Network Technologies
Canadian institutionsWestern University
Fundersnot available
KeywordsComputer scienceTurns, rounds and time-keeping systems in gamesConsistency (knowledge bases)Variety (cybernetics)Service (business)Quality of serviceLatency (audio)Quality (philosophy)Game mechanicsMultimediaVideo game designComputer networkArtificial intelligenceTelecommunications

Abstract

fetched live from OpenAlex

As more games of a wider variety of genres move online to provide multiplayer experiences to their players, there is an increasing need to improve the quality of service delivered to the players of these games. Players tend to have the same performance and consistency expectations of their online multiplayer games as they do of their single player games, without realizing the issues and problems introduced by networking their games together. This results in a tremendous challenge for developers of networked games, because issues such as latency work strongly against meeting the needs of players. In this paper, we discuss the concept of optimistic execution to help game developers mask or hide the effects of latency in their networked games. We introduce the notion of optimistic execution, present our work in this area, dubbed New HOPE, and comment on its ability to assist game developers in this important area.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.263
Threshold uncertainty score0.875

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.001
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.047
GPT teacher head0.315
Teacher spread0.268 · 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.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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
Published2005
Admission routes1
Has abstractyes

Explore more

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