atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

EnMatch: Matchmaking for Better Player Engagement via Neural Combinatorial Optimization

AAAI 2024 · Learning theory and algorithms › Submodular and game algorithms · approach: Opponent modeling and subgame solving · 3 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes EnMatch, an engagement-oriented k-vs-k matchmaking framework that couples a learned engagement model with a PPO-trained graph-encoder/masked-decoder neural combinatorial optimization policy and an LNS heuristic operator.

Problem

Tier-based fair matchmaking ignores player engagement; engagement-oriented team formation in k-vs-k games is an NP-hard combinatorial optimization with non-linear (neural) objectives and large search spaces.

Approach

Formulate matchmaking as an MDP where a neural engagement model provides rewards, and a GAT encoder with a Transformer masked decoder (KNN-based pointer-like selection) generates 2K players per match, refined by a large-neighborhood-search heuristic operator and trained with PPO.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add the auxiliary task during engagement-model training (ablation)EnMatchNet · SPGACC: 0.708 -> 0.734Helped
add the auxiliary task during engagement-model training (ablation)EnMatchNet · SPGAUC: 0.664 -> 0.683Helped
add the auxiliary task during engagement-model training (ablation)EnMatchNet · RPGPVPACC: 0.778 -> 0.798Helped
add the auxiliary task during engagement-model training (ablation)EnMatchNet · RPGPVPAUC: 0.751 -> 0.774Helped
use EnMatch instead of the strongest baselinematchmaking · SPG simulationcumulative reward per episode: 2.15%Helped
use EnMatch instead of the strongest baselinematchmaking · RPGPVP simulationcumulative reward per episode: 11.76%Helped
use EnMatch instead of the strongest baselineonline matchmaking · SPG online deploymentnumber of matches: 1.64%Helped
use EnMatch instead of the strongest baselineonline matchmaking · RPGPVP online deploymentnumber of matches: 7.19%Helped

Surprising findings

Limitations

Experimental setup

Datasets: SPG RPGPVP

Benchmarks: SPG RPGPVP online A/B test on two games

Metrics: accuracy AUC average cumulative reward per episode number of matches played

Baselines: Tier-based Heuristics PointerNetwork GloMatch OptMatch EOMM MBNet Random

Builds on: Proximal Policy Optimization Pointer Network EOMM GloMatch Large Neighborhood Search

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy