Procedural content generation (PCG) studies the algorithmic creation of content (e.g., textures, maps), typically for games. PCG has become a popular research topic in recent years, but little has been done in terms of generalized content generators: approaches that can generate content for a variety of games without hand-tuning. We are interested in exploring statistical algorithms that could ...

Generalized Tribonacci morphisms are defined on a three letters alphabet and generate the so-called generalized Tribonacci words. We present a family of combinatorial removal games on three piles of tokens whose set of P-positions is coded exactly by these generalized Tribonacci words. To obtain this result, we study combinatorial properties of these words like gaps between consecutive identica...

We identify a sufficient class of coalitional form games with transferable utility for which prenucleolus coincides with the Shapley value. We then apply our result to simple games and to generalized queueing games. Department of Economics, University of Warwick, Coventry, United Kingdom Economic Research Unit, Indian Statistical Institute, Kolkata, India Department of Economics, University of ...

The theory of non cooperative games with potential function was introduced by Monderer and Shapley in 1996. Such games have interesting properties, among which is the existence of equilibria in pure strategies. The paper by Monderer and Shapley has inspired many game theory researchers. In the present paper, many classes of multiobjective games with potential functions are studied. The notions ...

This paper investigates the role of interaction and coins in public-coin quantum interactive proof systems (also called quantum Arthur-Merlin games). While prior works focused on classical public coins even in the quantum setting, the present work introduces a generalized version of quantum Arthur-Merlin games where the public coins can be quantum as well: the verifier can send not only random ...

We propose a two-layer, semidecentralized algorithm to compute local solution the Stackelberg equilibrium problem in aggregative games with coupling constraints. Specifically, we focus on single-leader, multiple-follower problem, and after equivalently recasting game as mathematical program complementarity constraints (MPCC), iteratively convexify regularized version of MPCC inner whose generat...

Introduction. In several earlier papers [5] and [6], we discussed single pile games of Nim in which the number of counters that can be removed varies during the play of the game. In [4] we showed how to effectively play the single-pile game in which the number of counters that can be removed is a function of the number removed on the previous move. In that paper we constructed a number base and...