MétaCan
Menu
Back to cohort

Games for Routing and Path Coloring

2012· book-chapter· en· W204809062 on OpenAlexaff
Lacra Pavel

Bibliographic record

VenueBirkhäuser Boston eBooks · 2012
Typebook-chapter
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsRouting (electronic design automation)Path (computing)Computer scienceFocus (optics)Bounded functionMathematical optimizationMathematical economicsComputer networkMathematicsPhysics

Abstract

fetched live from OpenAlex

This chapter provides and overview of routing and path coloring problems in all-optical networks as noncooperative games. We focus on oblivious payment functions, that is, functions that charge a player according to its own strategy only. We review results on the relation between such games and online routing and path coloring. In particular, these results show that the Price of Anarchy of such games is lower-bounded by, and in several cases precisely equal to, the competitive ratio of appropriate modifications of the First Fit algorithm.

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: Not applicable · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.928
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.0000.000
Research integrity0.0010.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.021
GPT teacher head0.215
Teacher spread0.194 · 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 designNot applicable
Domainnot available
GenreOther

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

Explore more

Same venueBirkhäuser Boston eBooksSame topicAdvanced Optical Network TechnologiesFrench-language works237,207