Skill rating for multiplayer games. Introducing hypernode graphs and their spectral theory

MaRDI QIDQ4969092zbMATHFDO

Authors Thomas Ricatte, Rémi Gilleron, M. Tommasi

Publication date 5 October 2020

Full work available at URL https://jmlr.csail.mit.edu/papers/v21/13-561.html

zbMATH Keywords

hypergraphsgraph kernelsmultiplayer gamessemisupervised learninggraph Laplaciansspectral learningskill rating algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) (n)-person games, (n>2) (91A06)

Recommendations

• Graphical games
• Graph transduction as a noncooperative game
• Skill in Games
• Collective Games on Hypergraphs
• A Bayesian approximation method for online ranking

Cites work

• On the Laplacian Spectrum and Walk-regular Hypergraphs
• Spectra, Euclidean representations and clusterings of hypergraphs
• Spectral properties of hypergraph Laplacian and approximation algorithms

Describes a project that uses

Uses Software

• TrueSkill
• skills

This page was built for publication: Skill rating for multiplayer games. Introducing hypernode graphs and their spectral theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969092)