A two-stage, two-person tournament is discussed, in which each player can influence the other one at the first stage by choosing help, sabotage or no action. At the second stage, the players choose effort to win the tournament. Helping and sabotaging have two effects — they influence the...

A review of the literature on cost sharing solutions for the minimum cost spanning tree problem is proposed, with a particular focus on the folk and Kar solutions. We compare the characterizations proposed, helped by some equivalencies between sets of properties.

No abstract received.

No abstract received.

Restricting the analysis to general 2×2 coordination games, this article shows how under certain conditions, it is highly likely that individuals coordinate on a (pay-off) efficient through risk inferior convention. This contrasts with other equilibrium refinement criteria, such as risk...

The topic is two-fold. First, we prove the convexity of Owen's Airport Profit Game (inclusive of revenues and costs). As an adjunct, we characterize the class of 1-convex Airport Profit Games by equivalent properties of the corresponding cost function. Second, we classify the class of 1-convex...

The interaction between a sophisticated player and a fictitious player is analyzed and applied to the problem of optimal enforcement. An adaptive potential offender myopically responds to the history of past enforcement. How can a sophisticated enforcement official take advantage of this...

No abstract received.

From a special class of TU games with information cost, given by the problem of sharing the costs of facilities among users, we build a noncooperative game in which every player asks for the assessment of whom the users are. We analyze two models, "naming" game and majority decision game: the...