FP7Индивидуална стипендия2014–2016

OASIG · Ordered Algebraic Structures in Game Theory

7РП — „Хора“ (Действия „Мария Кюри“)

Период
2014-11-01 → 2016-10-31
Финансиране от ЕС
241 568 €
Участници
1
Схема
MC-IEF

Линиите свързват координатора с партньорите.

Накратко на български

Алгебричните структури се използват за решаване на проблеми в теорията на игрите, например при моделиране на коалиции между играчи. Това помага за по-доброто разбиране на поведението при сътрудничество и начина, по който се вземат решения в икономически модели.

Този кратък обзор е генериран от изкуствен интелект

Кратко обяснение, генерирано от езиков модел по текста на CORDIS. Оригиналът е по-долу.

Резултати накратко

Ordered Algebraic Structures in Game Theory

The main goal of this interdisciplinary project was to develop the methods and techniques of ordered algebraic structures for solving game-theoretic problems. Ordered algebras such as lattice ordered groups and Riesz spaces are abundant in most parts of pure and applied mathematics. In particular, various classes of partially ordered sets are used to model coalition structures in cooperative game theory. Lattice-ordered function spaces are the basis for abstract economic models and preference representation in decision theory. In the project we have put forward the detailed list of specific goals, each of which is related to a certain game-theoretic model (strategic, cooperative etc.) and a class of ordered algebras (MV-algebras, lattice groups, Riesz spaces). We will describe our work and the chief results of the project OASIG (Ordered Algebraic Structures in Game Theory). In the area of cooperative games we achieved a description of extreme supermodular games. This class of coalitional games is important for modeling cooperative behavior, where players have incentive to form large coalitions. The problem of describing the generators of the polyhedral cone was mentioned already in the seminal paper by Shapley. Combinatorial explosion makes it difficult to analyze the geometrical structure of the cone already for a very low number of players. We have given a simple linear-algebraic criterion for deciding whether a given supermodular game generates an extreme ray. Moreover, we provided an in-depth comparison between our result and the description of extremality in the supermodular cone achieved by other researchers. The obtained results were based on the core solution of a coalitional game. In non-supermodular games the core solution need not depict the results of the game faithfully. Therefore we designed a new solution concept for transferable-utility coalitional games, the so-called intermediate set, which combines ideas from combinatorial optimization (Lovász extension) with methods of non-smooth analysis (generalized derivatives). It was shown that the intermediate set is a non-convex polyhedron containing the Pareto optimal payoff vectors that depend on some chain of coalitions and marginal coalitional contributions with respect to the chain. We computed the exact form of intermediate set for all games and proved its simplified characterization for the voting games and the class of glove games. In a related line of research we relaxed the assumption that the cooperation structure is a finite Boolean lattice and investigated a more general class of games over finite distributive lattices. This enabled us to show that there is a natural and a more general framework for supermodular games than the one based on the powerset algebra of coalitions. We have also contributed to the subject of uncertainty modelling, which finds many applications in game theory. For example, probabilities are used in mixed strategy solutions or when dealing with beliefs of players. Our set up is genuinely algebraic and category-theoretic, making it possible to employ universal constructions in order to reason about properties of probabilities (or states). By introducing two distinct sorts we make a fundamental distinction between events, on the one hand, and probability degrees, on the other. At the same time both events and degrees of probabilty are naturally modelled by MV-algebras. A probability function is then conceived of as an operator between the two MV-algebras satisfying the standard axioms of finite additivity and normalization. Thus, generalised probabilities become unary operations in two-sorted algebraic structures that we call state algebras. We study free state algebras, their geometric representation, and their connection with the theory of affine representations of lattice-groups. A non-Archimedean model of probability based on the Chang algebra was discussed. In summary, the two-sorted approach to probability is a promising platform for modeling a number of economic and game-theoretic phenomena, ranging from higher-order uncertainty representation to belief modelling.

Текст от CORDIS, на английски · Данни: CORDIS, © Европейски съюз

Цел на проекта

The main goal of this project is to study ordered algebraic structures with regard to their applications in game theory. Theory of Riesz spaces, groups, and MV-algebras provide the tools necessary for modeling important aspects of mathematical games, such as economic rationality, strategic invariance, or fairness. This is already witnessed by many parts of game theory: for example, Aumann-Shapley value is a positive equivariant linear operator into the Riesz space of measures and MV-algebras model many coalition games. Our objective is to employ the methods, which were developed for solving deep algebraic and logical problems, in several important game-theoretic problems. Specifically, we will study the class of piecewise linear continuous strategic games by using the polyhedral representation of free MV-algebras and Baker-Beynon duality for unital free vector lattices, with the goal to show the existence of finitely-supported mixed strategy equilibria. We will investigate MV-algebras and their measures in order to model coalition games and their solutions. The motivation is to generalize the Danilov-Koshevoy representation of core by the convex Minkowski combination of simplices for larger classes of games. This inevitably leads to building dual representations of games based on the notion of generalized Moebius transform and the space of filters of an MV-algebra. Each facet of this project is transdisciplinary: the emphasis on algebra and order pervades all the selected game-theoretic scenaria. The presented proposal is an opportunity for the applicant to acquire new mathematical skills under the guidance of a scientist in charge - the specialist in ordered algebraic structures - and achieve thus a unique position in his own research field (game theory, many-valued logics).

Оригинален текст от CORDIS (на английски).

Участници

  • UNIVERSITA DEGLI STUDI DI MILANO · MilanoКоординаторИталия

Връзки

Данни: CORDIS, © Европейски съюз