Pith. sign in

Treatment Effect Estimation Amidst Dynamic Network Interference in Online Gaming Experiments

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

The evolving landscape of online multiplayer gaming presents unique challenges in assessing the causal impacts of game features. Traditional A/B testing methodologies fall short due to complex player interactions, leading to violations of fundamental assumptions like the Stable Unit Treatment Value Assumption (SUTVA). Unlike traditional social networks with stable and long-term connections, networks in online games are often dynamic and short-lived. Players are temporarily teamed up for the duration of a game, forming transient networks that dissolve once the game ends. This fleeting nature of interactions presents a new challenge compared with running experiments in a stable social network. This study introduces a novel framework for treatment effect estimation in online gaming environments, considering the dynamic and ephemeral network interference that occurs among players. We propose an innovative estimator tailored for scenarios where a completely randomized experimental design is implemented without explicit knowledge of network structures. Notably, our method facilitates post-hoc interference adjustment on experimental data, significantly reducing the complexities and costs associated with intricate experimental designs and randomization strategies. The proposed framework stands out for its ability to accommodate varying levels of interference, thereby yielding more accurate and robust estimations. Through comprehensive simulations set against a variety of interference scenarios, along with empirical validation using real-world data from a mobile gaming environment, we demonstrate the efficacy of our approach. This study represents a pioneering effort in exploring causal inference in user-randomized experiments impacted by dynamic network effects.

citation-role summary

background 1

citation-polarity summary

fields

cs.IR 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Algorithm Adaptation Bias in Recommendation System Online Experiments

cs.IR · 2025-08-29 · conditional · novelty 4.0

Recommendation-system A/B tests can systematically underestimate a new algorithm's true deployment effect because a small treatment group cannot trigger the full ecosystem's feedback loops, a bias the paper formalizes and illustrates.

citing papers explorer

Showing 1 of 1 citing paper.

  • Algorithm Adaptation Bias in Recommendation System Online Experiments cs.IR · 2025-08-29 · conditional · none · ref 14 · internal anchor

    Recommendation-system A/B tests can systematically underestimate a new algorithm's true deployment effect because a small treatment group cannot trigger the full ecosystem's feedback loops, a bias the paper formalizes and illustrates.