The Pre-Kernel as a Tractable Solution for Cooperative Games

The Pre-Kernel as a Tractable Solution for Cooperative Games PDF Author: Holger Ingmar Meinhardt
Publisher: Springer Science & Business Media
ISBN: 364239549X
Category : Mathematics
Languages : en
Pages : 270

Get Book Here

Book Description
This present book provides an alternative approach to study the pre-kernel solution of transferable utility games based on a generalized conjugation theory from convex analysis. Although the pre-kernel solution possesses an appealing axiomatic foundation that lets one consider this solution concept as a standard of fairness, the pre-kernel and its related solutions are regarded as obscure and too technically complex to be treated as a real alternative to the Shapley value. Comprehensible and efficient computability is widely regarded as a desirable feature to qualify a solution concept apart from its axiomatic foundation as a standard of fairness. We review and then improve an approach to compute the pre-kernel of a cooperative game by the indirect function. The indirect function is known as the Fenchel-Moreau conjugation of the characteristic function. Extending the approach with the indirect function, we are able to characterize the pre-kernel of the grand coalition simply by the solution sets of a family of quadratic objective functions.

The Pre-Kernel as a Tractable Solution for Cooperative Games

The Pre-Kernel as a Tractable Solution for Cooperative Games PDF Author: Holger Ingmar Meinhardt
Publisher: Springer Science & Business Media
ISBN: 364239549X
Category : Mathematics
Languages : en
Pages : 270

Get Book Here

Book Description
This present book provides an alternative approach to study the pre-kernel solution of transferable utility games based on a generalized conjugation theory from convex analysis. Although the pre-kernel solution possesses an appealing axiomatic foundation that lets one consider this solution concept as a standard of fairness, the pre-kernel and its related solutions are regarded as obscure and too technically complex to be treated as a real alternative to the Shapley value. Comprehensible and efficient computability is widely regarded as a desirable feature to qualify a solution concept apart from its axiomatic foundation as a standard of fairness. We review and then improve an approach to compute the pre-kernel of a cooperative game by the indirect function. The indirect function is known as the Fenchel-Moreau conjugation of the characteristic function. Extending the approach with the indirect function, we are able to characterize the pre-kernel of the grand coalition simply by the solution sets of a family of quadratic objective functions.

Introduction to the Theory of Cooperative Games

Introduction to the Theory of Cooperative Games PDF Author: Bezalel Peleg
Publisher: Springer Science & Business Media
ISBN: 3540729453
Category : Business & Economics
Languages : en
Pages : 336

Get Book Here

Book Description
This book systematically presents the main solutions of cooperative games: the core, bargaining set, kernel, nucleolus, and the Shapley value of TU games as well as the core, the Shapley value, and the ordinal bargaining set of NTU games. The authors devote a separate chapter to each solution, wherein they study its properties in full detail. In addition, important variants are defined or even intensively analyzed.

Cooperative Games, Solutions and Applications

Cooperative Games, Solutions and Applications PDF Author: Theo S. H. Driessen
Publisher: Springer Science & Business Media
ISBN: 9401577870
Category : Business & Economics
Languages : en
Pages : 235

Get Book Here

Book Description
The study of the theory of games was started in Von Neumann (1928), but the development of the theory of games was accelerated after the publication of the classical book "Theory of games and economic behavior" by Von Neumann and Morgenstern (1944). As an initial step, the theory of games aims to put situations of conflict and cooperation into mathematical models. In the second and final step, the resulting models are analysed on the basis of equitable and mathematical reasonings. The conflict and/or cooperative situation in question is generally due to the interaction between two or more individuals (players). Their interaction may lead up to several potential payoffs over which each player has his own preferences. Any player attempts to achieve his largest possible payoff, but the other players may also exert their influence on the realization of some potential payoff. As already mentioned, the theory of games consists of two parts, a modelling part and a solution part. Concerning the modelling part, the mathematical models of conflict and cooperative situations are described. The description of the models includes the rules, the strategy space of any player, potential payoffs to the players, the preferences of each player over the set of all potential payoffs, etc. According to the rules, it is either permitted or forbidden that the players communicate with one another in order to make binding agreements regarding their mutual actions.

General Equilibrium and Game Theory

General Equilibrium and Game Theory PDF Author: Andreu Mas-Colell
Publisher: Harvard University Press
ISBN: 0674728734
Category : Business & Economics
Languages : en
Pages : 249

Get Book Here

Book Description
Andreu Mas-Colell revolutionized our understanding of competitive markets, price formation, and the behavior of market participants. This volume presents the papers that solidified his standing as one of the preeminent economic theorists of our time. It also is invaluable for anyone wishing to study the craft of a master of economic modeling.

Handbook of combinatorial optimization

Handbook of combinatorial optimization PDF Author: Dingzhu Du
Publisher: Springer Science & Business Media
ISBN: 9780792352938
Category : Science
Languages : en
Pages : 774

Get Book Here

Book Description
This is the second of a multi-volume set. The various volumes deal with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The emphasis is on late-1990s developments. Each chapter is essentially expository in nature, but scholarly in its treatment.

Handbook of Combinatorial Optimization

Handbook of Combinatorial Optimization PDF Author: Ding-Zhu Du
Publisher: Springer Science & Business Media
ISBN: 1461303036
Category : Mathematics
Languages : en
Pages : 2410

Get Book Here

Book Description
Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics).

Computing and Combinatorics

Computing and Combinatorics PDF Author: Joachim Gudmundsson
Publisher: Springer
ISBN: 3642322417
Category : Computers
Languages : en
Pages : 617

Get Book Here

Book Description
This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012. The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization.

Game Theoretic Analysis

Game Theoretic Analysis PDF Author: Leon A Petrosyan
Publisher: World Scientific
ISBN: 9811202028
Category : Mathematics
Languages : en
Pages : 621

Get Book Here

Book Description
This is a collection of recent novel contributions in game theory from a group of prominent authors in the field. It covers Non-cooperative Games, Equilibrium Analysis, Cooperative Games and Axiomatic Values in static and dynamic contexts.Part 1: Non-cooperative Games and Equilibrium AnalysisIn game theory, a non-cooperative game is a game with competition between individual players and in which only self-enforcing (e.g. through credible threats) alliances (or competition between groups of players, called 'coalitions') are possible due to the absence of external means to enforce cooperative behavior (e.g. contract law), as opposed to cooperative games. In fact, non-cooperative games are the foundation for the development of cooperative games by acting as the status quo. Non-cooperative games are generally analysed through the framework of equilibrium, which tries to predict players' individual strategies and payoffs. Indeed, equilibrium analysis is the centre of non-cooperative games. This volume on non-cooperative games and equilibrium analysis contains a variety of non-cooperative games and non-cooperative game equilibria from prominent authors in the field.Part 2: Cooperative Games and Axiomatic ValuesIt is well known that non-cooperative behaviours, in general, would not lead to a Pareto optimal outcome. Highly undesirable outcomes (like the prisoner's dilemma) and even devastating results (like the tragedy of the commons) could appear when the involved parties only care about their individual interests in a non-cooperative situation. Cooperative games offer the possibility of obtaining socially optimal and group efficient solutions to decision problems involving strategic actions. In addition, axiomatic values serve as guidance for establishing cooperative solutions. This volume on cooperative games and axiomatic values presents a collection of cooperative games and axiomatic values from prominent authors in the field.

Essays in Game Theory

Essays in Game Theory PDF Author: Nimrod Megiddo
Publisher: Springer Science & Business Media
ISBN: 1461226481
Category : Mathematics
Languages : en
Pages : 209

Get Book Here

Book Description
This volume presents a collection of papers on game theory dedicated to Michael Maschler. Through his dedication and contributions to game theory, Maschler has become an important figure particularly in the area of cooperative games. Game theory has since become an important subject in operations research, economics and management science. As befits such a volume, the main themes covered are cooperative games, coalitions, repeated games, and a cost allocation games. All the contributions are authoritative surveys of a particular topic, so together they will present an invaluable overview of the field to all those working on game theory problems.

Essays in Mathematical Economics, in Honor of Oskar Morgenstern

Essays in Mathematical Economics, in Honor of Oskar Morgenstern PDF Author: Martin Shubik
Publisher: Princeton University Press
ISBN: 1400877385
Category : Business & Economics
Languages : en
Pages : 498

Get Book Here

Book Description
Professor Morgenstern's deep interests in economic time series and problems of measurement are represented by path-breaking articles devoted to the application of modern statistical analysis to temporal economic data. Originally published in 1967. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.