Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 19 of the 21 references it cites were found in a registry or an index.

Configurable Agent With Reward As Input: A Play-Style Continuum Generation

Open access
Le Pelletier de Woillemont, Pierre, Labory, Remi, Corruble, Vincent · 2021 · 2021 IEEE Conference on Games (CoG)

Abstract

Modern video games are becoming richer and more complex in terms of game mechanics. This complexity allows for the emergence of a wide variety of ways to play the game across the players. From the point of view of the game designer, this means that one needs to anticipate a lot of different ways the game could be played. Machine Learning (ML) could help address this issue. More precisely, Reinforcement Learning is a promising answer to the need of automating video game testing. In this paper we present a video game environment which lets us define multiple play-styles. We then introduce CARI: a Configurable Agent with Reward as Input. An agent able to simulate a wide continuum range of play-styles. It is not constrained to extreme archetypal behaviors like current methods using reward shaping. In addition it achieves this through a single training loop, instead of the usual one loop per play-style. We compare this novel training approach with the more classic reward shaping approach and conclude that CARI can also outperform the baseline on archetypes generation. This novel agent could be used to investigate behaviors and balancing during the production of a video game with a realistic amount of training time.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/cog52621.2021.9619127

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 21 references

Research works printed but not linked: 4

  1. norouzzadeh ravari, 0, Playing styles in starcraft, 2018 european GAME-ON Conference on Simulation and AI in Computer Games
  2. ng, 2000, Algorithms for inverse reinforcement learning, ICML, 1, 2
  3. vinyals, 2019, Alphastar Mastering the real-time strategy game StarCraft II
  4. andrade, 2005, Automatic computer game balancing a reinforcement learning approach, 1111

Cited by

See all 13

Metadata

Authors
Le Pelletier de Woillemont, P., Labory, R., & Corruble, V.
Affiliations
Centre National de la Recherche Scientifique (FR)
Venue
2021 IEEE Conference on Games (CoG)
Publisher
IEEE
Published
2021-08-17
Pages
1-8
OpenAlex
W4205137590
Cited by
12
References
21
Citations by year
2026: 1 · 2025: 2 · 2024: 1 · 2023: 5 · 2022: 3
FWCI
1.04
Type
conference paper
Language
en
Open access
Locations
  • IEEE Conference on Games (CoG) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • HAL (submittedVersion, other-oa)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Social Sciences › Sociology and Political Science › Digital Games and Media
Keywords
reinforcement learning agents, reward shaping, game balance, game mechanics, CARI

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Configurable Agent With Reward As Input: A Play-Style Continuum Generation. https://app.cochat.ai/papers/10.1109/cog52621.2021.9619127
The paper
Le Pelletier de Woillemont, P., Labory, R., & Corruble, V. (2021). Configurable Agent With Reward As Input: A Play-Style Continuum Generation. 2021 IEEE Conference on Games (CoG). https://doi.org/10.1109/cog52621.2021.9619127

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.