Oana Andrei

Oana Andrei

Auto-generated profile, based on publicly available information

Oana Andrei

University of Glasgow, Glasgow, United Kingdom

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2007 in Theoretical Computer Science
Verified
Journal Article
Closed access
OAOana Andrei
Oana Andrei
Gabriel CiobanuGabriel Ciobanu
Gabriel Ciobanu
DLDorel Lucanu
Dorel Lucanu

1 November 2008 in Electronic Notes in Theoretical Computer Science
Verified
Journal Article
Open access
OAOana Andrei
Oana Andrei
HKHélène Kirchner
Hélène Kirchner
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of these structures is expressed with multigraph rewrite rules and a multigraph rewriting relation. Then we encode the multigraphs and multigraph rewriting using algebraic terms and term rewriting to provide an operational semantics of the multigraph rewriting relation. This term version can be embedded in the rewriting calculus, thus defining for labeled multigraph transformations a high-level pattern calculus, called ρmg-calculus

1 January 2009
Verified
Book Chapter
Closed access
PDF file
OAOana Andrei
Oana Andrei
HKHélène Kirchner
Hélène Kirchner

1 January 2005
Verified
Book Chapter
Closed access
PDF file
OAOana Andrei
Oana Andrei
Gabriel CiobanuGabriel Ciobanu
Gabriel Ciobanu
DLDorel Lucanu
Dorel Lucanu


23 September 2019 in IEEE Transactions on Games
Verified
Journal Article
Closed access
WKWilliam Kavanagh
William Kavanagh
Alice MillerAlice Miller
Alice Miller
Gethin NormanGethin Norman
Gethin Norman
OAOana Andrei
Oana Andrei
Probabilistic model checking can overcome much of the complexity inherent in balancing games. Game balancing is the careful maintenance of relationships between the ways in which a game can be played, to ensure that no single way is strictly better than all others, and that players are offered a wide variety of ways to play successfully. We introduce a novel approach toward automating game balancing using probabilistic model checking called chained strategy generation (CSG). This involves generating chains of adversarial strategies, which mimic the way players adapt their approach during repeated plays of a game. We use CSG to map out the evolving metagame. The trends identified can allow game developers to identify strategies, which will be too strong, and ways of playing the game, which a player may want to use, but are never viable for successful competitive play. We introduce a case study, a game called RPGLite, and use CSG to compare five candidate configurations for the game. We show how to determine which configurations of RPGLite lead to a more fair and interesting experience for players. We also identify unexpected trends in how the strategies evolve. Our approach introduces a new technique for improving game development and player experience.