ةصلاخلا : ىبرهكلا كيرحتلا و ةردقلا تاينورتكلا تاقيبطت نم ديدع ىف عسوتب مدختست تاروتسريثلا . ايبس ن ريغص لا مجحلا آ تاز يمملا نم ديدعب عتمتت اهنلأ اذه و و ضفخنملا اهرعس و قوسلا ىف اهرفوت . تاروتسريثلا مادختساب روطلا ى ثلاث ى ثح كرحمل طخلا دهج ىف مكحتملل ةيليصفت ةاآاحم لمع و ليلحت مت ثحبلا اذه ىف و . روطلا ىثلاث ردصملل هجولا ةيواز ىف مكحتلاب كرحملل تباثلا وضعلا دهج ىف مكحتلا مت و . اوتلا ريثأت ...

We consider the problem of axiomatizing the Shapley value on the class of assignment games. We first show that several axiomatizations of the Shapley value on the class of all TU-games do not characterize this solution on the class of assignment games by providing alternative solutions that satisfy these axioms. However, when considering an assignment game as a communication graph game where th...

In this paper, a new iteration approach is derived to solve the optimal strategies for quadratic zero-sum game of finite-horizon continuous-time nonaffine nonlinear system. Through iteration algorithm between two sequences which are a sequence of state trajectories of linear quadratic zero-sum games and a sequence of corresponding Riccati differential equations, the optimal strategies for the n...

Strictly competitive games are a class of 2-player games often quoted in the literature to be a proper generalization of zero-sum games. Other times it is claimed, e.g. by Aumann, that strictly competitive games are only payoff transformations of zero-sum games. But to the best of our knowledge there is no proof of such claim. We shed light to this point of confusion in the literature, showing ...

We show that a symmetric two-player zero-sum game has a pure strategy equilibrium if and only if it is not a generalized rock-paper-scissors matrix. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure equilibrium. Further sufficient conditions for existence are provided. We point out that the class of symmetric two-player zero-sum games coincides with ...

W present a diagrammatic method that allows the determination of all Nash equilibria of 2×M nonzero sum games, extending thus the well known diagrammatic techniques for 2 × M zero sum and 2 × 2 nonzero sum games. We show its appropriateness for teaching purposes by analyzing modified versions of the prisoners’ dilemma, the battle of the sexes, as well as of the zero sum game of matching pennies...

This paper discusses, in both continuous time and discrete time, the issue of certainty equivalence in two-player zero-sum stochastic differential/dynamic games when the players have access to state information through a common noisy measurement channel. For the discrete-time case, the channel is also allowed to fail sporadically according to an independent Bernoulli process, leading to intermi...

Game playing is one of the most important areas in AI. Chess is a very popular two-player strategy board game. In the context of AI, chess falls under the category of adversarial games where the opponent tries to reduce your chance of winning as much as possible. Being a classic example of a two-player zero sum game (sum of the utilities of agent and opponent is zero), the game of chess provide...