Cooperative game theory - Wikipedia. In game theory, a cooperative game (or coalitional game) is a game with competition between groups of players (. Those are opposed to non- cooperative games in which there is either no possibility to forge alliances or all agreements need to be self- enforcing (e. It is opposed to the traditional non- cooperative game theory which focuses on predicting individual players' actions and payoffs and analyzing Nash equilibriums. As non- cooperative game theory is more general, cooperative games can be analyzed through the approach of non- cooperative game theory (the converse does not hold) provided that sufficient assumptions are made to encompass all the possible strategies available to players due to the possibility of external enforcement of cooperation. While it would thus be optimal to have all games expressed under a non- cooperative framework, in many instances insufficient information is available to accurately model the formal procedures available to the players during the strategic bargaining process, or the resulting model would be of too high complexity to offer a practical tool in the real world. In such cases, cooperative game theory provides a simplified approach that allows to analyze the game at large without having to make any assumption about bargaining powers. Mathematical definition. Formally, the coalitional game consists of a finite set of players N. The function describes how much collective payoff a set of players can gain by forming a coalition, and the game is sometimes called a value game or a profit game. The players are assumed to choose which coalitions to form, according to their estimate of the way the payment will be divided among coalition members. In game theory, a cooperative game (or coalitional game) is a game with competition between groups of players ('coalitions') due to the possibility of external enforcement of cooperative behavior (e.g.Modeling individual preferences for ownership: and sharing of autonomous vehicle technologies. Director, Center for Transportation Research; University Distinguished Teaching Professor; Adnan Abou. In their survey of empirical research methods in OM, Flynn et al. We value excellent academic writing and strive to deliver outstanding paper writing service each and every time you place an order. We write essays, research papers, term papers, course works, reviews, theses and more, so our. The International Journal of Operational Research from Inderscience Publishers covers new theory and application of operations research (OR) techniques and models”>. PDF; PDF; Print; Help NASA SBIR/STTR Program Support For questions about the NASA SBIR/STTR solicitations, the proposal preparation and electronic submission process, and other program related areas, please contact the NASA. Selected online publications: Lyneis, J. How to Save a Leaky Ship: Capability Traps and the Failure of Win-Win Investments in Sustainability and Social Responsibility. Academy of Management Discoveries. John von Neumann Theory Prize; Awarded for: Fundamental, sustained contributions to theory in operations research and the management sciences: First awarded: 1975: Official website: John von Neumann Theory Prize. The ECE Departmental Colloquium hosts talks across the spectrum of Electrical and Computer Engineering and related fields. The Colloquium series contains a mix of presentations from faculty within Rutgers as. Conversely, a cooperative game can also be defined with a characteristic cost function c: 2. N. In this setting, players must accomplish some task, and the characteristic function c. A game of this kind is known as a cost game. Although most cooperative game theory deals with profit games, all concepts can easily be translated to the cost setting. Duality. A cooperative game and its dual are in some sense equivalent, and they share many properties. For example, the core of a game and its dual are equal. For more details on cooperative game duality, see for instance (Bilbao 2. Subgames. Subgames are useful because they allow us to apply solution concepts defined for the grand coalition on smaller coalitions. Properties for characterization. This means that the value of a union of disjoint coalitions is no less than the sum of the coalitions' separate values: v(S. This follows from superadditivity if payoffs are normalized so singleton coalitions have value zero. Properties for simple games. Equivalently, a simple game can be defined as a collection W. It is sometimes assumed that a simple game is nonempty or that it does not contain an empty set. In other areas of mathematics, simple games are also called hypergraphs or Boolean functions (logic functions). A simple game W. Supposing there is a veto player, any coalition not containing a veto player is losing. The dictator does not belong to any losing coalition. When a simple game has a carrier, any player not belonging to it is ignored. A simple game is sometimes called finite if it has a finite carrier (even if N. According to Nakamura's theorem, the number measures the degree of rationality; it is an indicator of the extent to which an aggregation rule can yield well- defined choices. A few relations among the above axioms have widely been recognized, such as the following (e. Peleg, 2. 00. 2, Section 2. Then, assuming that coalitions have the ability to enforce coordinated behaviour, there are several cooperative games associated with G. These games are often referred to as representations of G. The two standard representations are. By 'guaranteeing', it is meant that the value is the max- min, e. By 'strategically guaranteeing', it is meant that the value is the min- max, e. The challenge is then to allocate the payoff v(N). Researchers have proposed different solution concepts based on different notions of fairness. Some properties to look for in a solution concept include: Efficiency: The payoff vector exactly splits the total value: . An additive solution concept assigns to every player in (v+. In economic terms, a null player's marginal value to any coalition that does not contain him is zero. An efficient payoff vector is called a pre- imputation, and an individually rational pre- imputation is called an imputation. Most solution concepts are imputations. The stable set. In other words, players in S. The definition is very general allowing the concept to be used in a wide variety of game formats. Properties. Therefore, no coalition has incentive to leave the grand coalition and receive a larger payoff. Properties. Games with non- empty cores are called balanced. If it is non- empty, the core does not necessarily contain a unique vector. The core is contained in any stable set, and if the core is stable it is the unique stable set; see (Driessen 1. The core of a simple game with respect to preferences. A profile is a list p=(. Given a simple game v. Nakamura's theorem states that the core C(v,p). A variant by Kumabe and Mihara states that the core C(v,p). Clearly, regardless of whether the core is empty, the strong . Following this line of reasoning, the least- core, introduced in (Maschler, Peleg & Shapley 1. It can also be viewed as the strong . It was introduced by Lloyd Shapley (Shapley 1. The Shapley value of a superadditive game is individually rational, but this is not true in general. The maximum surplus of player i over player j with respect to x issijv(x)=max. The maximum surplus is a way to measure one player's bargaining power over another. Intuitively, player i has more bargaining power than player j with respect to imputationx if sijv(x)> sjiv(x). The kernel contains all imputations where no player has this bargaining power over another. This solution concept was first introduced in (Davis & Maschler 1. The nucleolus. To define the nucleolus, we consider the lexicographic ordering of vectors in R2. N. This solution concept was first introduced in (Schmeidler 1. Although the definition of the nucleolus seems abstract, (Maschler, Peleg & Shapley 1. Starting with the least- core, record the coalitions for which the right- hand side of the inequality in the definition of C. Continue decreasing the right- hand side for the remaining coalitions, until it cannot be reduced without making the set empty. Record the new set of coalitions for which the inequalities hold at equality; continue decreasing the right- hand side of remaining coalitions and repeat this process as many times as necessary until all coalitions have been recorded. The resulting payoff vector is the nucleolus. Properties. Specifically, a game is convex if its characteristic function v. For cost games, the inequalities are reversed, so that we say the cost game is convex if the characteristic function is submodular. Properties. Any vertex of the core can be constructed in this way by choosing an appropriate permutation. Many of the results in (Shapley 1. Edmonds 1. 97. 0), where submodular functions were first presented as generalizations of matroids. In this context, the core of a convex cost game is called the base polyhedron, because its elements generalize base properties of matroids. However, the optimization community generally considers submodular functions to be the discrete analogues of convex functions (Lov. Unfortunately, this conflicts directly with Shapley's original definition of supermodular functions as . Handbook of Social Choice and Welfare Volume 1. Handbook of Social Choice and Welfare. In particular, all finite games are computable.^Kumabe, M.; Mihara, H. Journal of Mathematical Economics. The sixteen types are defined by the four conventional axioms (monotonicity, properness, strongness, and non- weakness). For example, type 1. Among type 1. 11. Observe that except for type 1. Kumabe, M.; Mihara, H. Social Choice and Welfare. Cooperative Stochastic Differential Games (Springer Series in Operations Research and Financial Engineering), Springer, 2. Softcover- ISBN 9. Yeung, David W. K. Subgame Consistent Economic Optimization: An Advanced Cooperative Dynamic Game Analysis (Static & Dynamic Game Theory: Foundations & Applications), Birkh. ISBN 9. 78- 0. 81.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
September 2017
Categories |