An explicit bound on " for nonemptiness of "-cores of games

We consider parameterized collections of games without side payments and determine a bound on E so that all suffciently large games in the collection have non-empty E-cores. Our result makes explicit the relationship between the required size of E for non-emptiness of the E-core, the parameters describing the collection of games, and the size of the total player set. Given the parameters describing the collection, the larger the game, the smaller the E that can bechosen

Core equivalence theorems for infinite convex games

We show that the core of a continuous convex game on a measurable space of players is a von Neumann-Morgenstern stable set. We also extend the definition of the Mas-Colell bargaining set to games with a measurable space of players, and show that for continuous convex games the core may be strictly included in the bargaining set but it coincides with the set of all countably additive payoff measures in the bargaining set. We provide examples which show that the continuity assumption is essential to our results

Cores of combined games

This paper studies the core of combined games, obtained by summing two coalitional games. It is shown that the set of balanced transferable utility games can be partitioned into equivalence classes of component games whose core is equal to the core of the combined game. On the other hand, for non balanced games, the binary relation associating two component games whose combination has an empty core is not transitive. However, we identify a class of non balanced games which, combined with any other non balanced game, has an empty core.Cooperative games, Core, Additivity, Issue Linkage, Multi Issue Bargaining

On the Convexity of News Vendor Games

This study considers a simple newsvendor situation that consists of n retailers, all selling the same item with common purchasing costs and common selling prices.Groups of retailers might increase their expected joint profit by inventory centralization, which means that they make a joint order to satisfy total future demand.The resulting newsvendor games are shown to have non-empty cores in the literature.This study investigates convexity of newsvendor games.We focus our analysis on the class of newsvendor games with independent symmetric unimodal demand distributions after providing several examples outside this class that are not convex.Several interesting subclasses, containing convex games only, are identified.Additionally, we illustrate that these results can not be extended to all games in this class.game theory;inventory centralization;newsvendor;convexity

The convexity-cone approach to comparative risk and downside risk.

We establish a calculus characterization of the core of supermodular games, which reduces the description of the core to the computation of suitable Gateaux derivatives of the Choquet integrals associated with the game. Our result generalizes to infinite games a classic result of Shapley (1971). As a secondary contribution, we provide a fairly complete analysis of the Gateaux and Frechet differentiability of the Choquet integrals of supermodular measure games.

"An Explicit Bound on E For Nonemptimess of E-Cores of Games"

We consider parameterized collections of games without side payments and determine a bound on E so that all sufficiently large games in the collection have non-empty E-cores. Our result makes explicit the relationship between the required size of E for non-emptiness of the E-core, the parameters describing the collection of games, and the size of the total player set. Given the parameters describing the collection, the larger the game, the smaller the E that can be chosen

Applying Abstract Argumentation Theory to Cooperative Game Theory

We apply ideas from abstract argumentation theory to study cooperative game theory. Building on Dung's results in his seminal paper, we further the correspondence between Dung's four argumentation semantics and solution concepts in cooperative game theory by showing that complete extensions (the grounded extension) correspond to Roth's subsolutions (respectively, the supercore). We then investigate the relationship between well-founded argumentation frameworks and convex games, where in each case the semantics (respectively, solution concepts) coincide; we prove that three-player convex games do not in general have well-founded argumentation frameworks.Comment: 15 pages, 1 tabl

Epsilon cores of games and economies with limited side payments

We introduce the concept of a parameterized collection of games with limited side payments, ruling out large transfers of utility. Under the assumption that the payoff set of the grand coalition is convex, we show that a game with limited side payments has a nonempty E-core. Our main result is that, when some degree of side-paymentness within nearly-effective small groups is assumed, then all payoffs in the E-core treat similar players similarly. A bound on the distance between E-core payoffs of any two similar players is given in terms of the parameters describing the game. These results add to the literature showing that games with many players and small effective groups have the properties of competitive markets.cooperative games ; equal treatment ; core convergence ; games without side payments (NTU games) ; large games ; approximate cores ; effective small groups ; parameterized collections of games

Epsilon cores of games and economies with limited side payments

We introduce the concept of a parameterized collection of games with limited side payments, ruling out large transfers of utility. Under the assumption that the payoff set of the grand coalition is convex, we show that a game with limited side payments has a nonempty epsilon-core. Our main result is that, when some degree of side-paymentness within nearly-effective small groups is assumed, then all payoffs in the epsilon-core treat similar players similarly. A bound on the distance between epsilon-core payoffs of any two similar players is given in terms of the parameters describing the game. These results add to the literature showing that games with many players and small effective groups have the properties of competitive markets.