Using Evolutionary Algorithms to Target Complexity Levels in Game Economies

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Article{Rogers:games,

• author = "Katja Rogers and Vincent {Le Claire} and Julian Frommel and Regan Mandryk and Lennart E. Nacke",
• title = "Using Evolutionary Algorithms to Target Complexity Levels in Game Economies",
• journal = "IEEE Transactions on Games",
• year = "2023",
• volume = "15",
• number = "1",
• pages = "56--66",
• keywords = "genetic algorithms, genetic programming",
• ISSN = "2475-1510",
• DOI = "doi:10.1109/TG.2023.3238163",
• abstract = "Game economies (GEs) describe how resources in games are created, transformed, or exchanged: they underpin most games and exist in different complexities. Their complexity may directly impact player difficulty. Nevertheless, neither difficulty nor complexity adjustment has been explored for GEs. Moreover, there is a lack in knowledge about complexity in GEs, how to define or assess it, and how it can be employed by automated adjustment approaches in game development to target specific complexity. We present a proof-of-concept for using evolutionary algorithms to craft targeted complexity graphs to model GEs. In a technical evaluation, we tested our first working definition of complexity in GEs. We then evaluated player-perceived complexity in a city-building game prototype through a user study and confirmed the generated GEs' complexity in an online survey. Our approach towards reliably creating GEs of specific complexity can facilitate game development and player testing but also inform and ground research on player perception of GE complexity.",
• notes = "Also known as \cite{10026324}",

}

Genetic Programming entries for Katja Rogers Vincent Le Claire Julian Frommel Regan Mandryk Lennart E Nacke

Citations