This paper studies a machine (finite automaton) playing a two-player repeated game of a simple extensive-form game with perfect information. We introduce a new complexity measure called multiple complexity which incorporates a strategyʼs responsiveness to information in the stage game as well...

We study a new monotonicity problem in combinatorial auctions called goods revenue　monotonicity, which requires that the auctioneer earn no more revenue by dropping goods from the endowments. Although no mechanism satisfies goods revenue monotonicity together with strategy-proofness,...

When encountering a set of alternatives displayed in the form of a list, the decision maker usually determines a particular alternative, after which she stops checking the remaining ones, and chooses an alternative from those observed so far. We present a framework in which both decision...

This paper studies a two-player machine (finite automaton) game in which an extensive game with perfect information is infinitely repeated. We introduce a new measure of strategic complexity named "multiple complexity", which considers the responsiveness of a strategy to information as well as...

When encountering a set of alternatives displayed in the form of a list, the decision maker usually determines a particular alternative, after which she stops checking the remaining ones, and chooses an alternative from those observed so far. We present a framework in which both decision...

We provide a model of coalitional bargaining with claims in order to solve games with non-transferable utilities and externalities.  We show that, for each such game, payoff configurations exist which will not be renegoiated.  In the original game derived from these payoff configurations, we...

The class of games with one apex player is generalized to the class of games with a collection of apex sets. These simple games, together with a power index, canonically induce a hedonic coalition formation game. A monotonicity property of solutions is introduced and its meaning for the induced...

An apex game consists of one apex player and a set of minor players. We identify two key properties of apex games and use them to introduce the class of general apex games. We derive players' preferences over winning coalitions by applying strongly monotonic power indices on such a game and all...

We generalize the class of apex game by combining a winning coalition of symmetric minor players with a collection of apex sets which can form winning coalitions only together with a fixed quota of minor players.  By applying power indices to these games and their subgames we generate players'...