In rational verification, the aim is to verify which temporal logic properties will obtain in a multi-agent system, under assumption that agents ("players") system choose strategies for acting form game theoretic equilibrium. Preferences are typically defined by assuming act pursuit of individual goals, specified as formulae. To date, verification has been studied using non-cooperative solution...

Cooperative games are very useful in considering profit allocation among multiple decision makers who cooperate with each other. In order to deal with cooperative games in practical situations, however, we have to deal with two additional factors. One is some restrictions on coalitions and the other is partial cooperation of players. In this paper we take both of these factors into account in c...

Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period...

Games on lattices generalize classical cooperative games (coalitional games), bi-cooperative games, multichoice games, etc., and provide a general framework to define actions of players in a cooperative game. We provide here an axiomatization of the Shapley value and interaction index for such games.

In this paper standard oligopolies are interpreted in two ways, namely as oligopolies without transferable technologies and as oligopolies with transferable technologies. From a cooperative point of view this leads to two diierent classes of cooperative games. We show that cooperative oligopoly games without transferable technologies are convex games and that cooperative oligopoly games with tr...

We study the approximation of the least core value and the least core of supermodular cost cooperative games. We provide a framework for approximation based on oracles that approximately determine maximally violated constraints. This framework yields a 3-approximation algorithm for computing the least core value of supermodular cost cooperative games, and a polynomial-time algorithm for computi...

We examine cooperative games in supply-chain management termed Inventory Games. Supply-chain management has non-cooperative and cooperative interactions between the participating players. We provide a concise survey of cooperative inventory games in the form of extensions on two basic problems. For deterministic games, Economic Order Quantity-like policies with joint replenishment are of primar...