We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm to solve the problem for all monotonic coalitional games provided that player types are known and the number of player types is bounded by a constant. As a c...

We propose an incomplete information analogue of rationalizability. An action is said to be belief-free rationalizable if it survives the following iterated deletion process. At each stage, we delete actions for a type of a player that are not a best response to some conjecture that puts weight only on profiles of types of other players and states that that type thinks possible, combined with a...

Two players simultaneously decide whether or not to acquire new weapons in an arms race game. Each player’s type determines his propensity to arm. Types are private information, and are independently drawn from a continuous distribution. With probability close to one, the best outcome for each player is for neither to acquire new weapons (although each prefers to acquire new weapons if he think...

The use of statistical and machine learning approaches, such as Markov chains, for procedural content generation (PCG) has been growing in recent years in the field of Game AI. However, there has been little work in learning to generate content, specifically levels, accounting for player movement within those levels. We are interested in extracting player models automatically from play traces a...

We study two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses. Both conditions generalize the corresponding classical omega-regular conditions and the corresponding finitary conditions. For parity games with costs we show that the first playe...

The effective acquisition of (semantic) metadata is crucial for many present day applications. Games with a purpose address this issue by transforming computational problems into computer games. We present a novel approach to metadata acquisition via Little Search Game (LSG) – a competitive web search game, whose purpose is the creation of a term relationship network. From a player perspective,...

Abstract Gamification has been discussed as a standout approach to improve user experience, with different studies showing that users can have preferences over game elements according their types. However, relatively less is known how kinds of may react types gamification. Therefore, in this study ( $$N=331$$ N</mml:mi...

The host immunological pathways are re-organized to get a clear picture. There are four acute immune responses: TH1/TH2/TH22/THαβ which are corresponding to four chronic immune responses: TH1Like/TH9/TH17/TH3. Then, the four branches of immune reactions can link to four types of hypersensitivities or allergies. THfh is the stimulatory pathway to initiate adaptive acute immunity. Another inhibit...

We study the long-run sustainability of private reputations in the presence of imperfect public monitoring. A long-lived player has private reputations if the uninformed players’ beliefs are private. We show that even in this case it is impossible to maintain a permanent reputation for playing a strategy that does not eventually play an equilibrium of the game without uncertainty about types. T...

Digital games have become a key player in the entertainment industry, attracting millions of new players each year. In spite of that, novice players may have a hard time when playing certain types of games, such as MOBAs and MMORPGs, due to their steep learning curves and not so friendly online communities. In this paper, we present an approach to help novice players in MOBA games overcome thes...