منابع مشابه
Agent Failures in Totally Balanced Games and Convex Games
We examine the impact of independent agents failures on the solutions of cooperative games, focusing on totally balanced games and the more speci c subclass of convex games. We follow the reliability extension model, recently proposed in [1] and show that a (approximately) totally balanced (or convex) game remains (approximately) totally balanced (or convex) when independent agent failures are ...
متن کاملSubadditive and Homogeneous of Degree One Games Are Totally Balanced
A cooperative game with transferable utility is said to be homogeneous of degree one if for any integer m, the value of cloning m times all players at any given coalition, leads to m times the value of the original coalition. We show that this property coupled with sub-additivity, guarantee the non-emptyness of the core of the game and of all its subgames, namely the game is totally balanced. E...
متن کاملProduction-inventory games: A new class of totally balanced combinatorial optimization games
In this paper we introduce a new class of cooperative games that arise from production-inventory problems. Several agents have to cover their demand over a finite time horizon and shortages are allowed. Each agent has its own unit production, inventory-holding and backlogging cost. Cooperation among agents is given by sharing production processes and warehouse facilities: agents in a coalition ...
متن کاملTotally Unimodular Congestion Games
We investigate a new class of congestion games, called Totally Unimodular (TU) Congestion Games, where the players’ strategies are binary vectors inside polyhedra defined by totally unimodular constraint matrices. Network congestion games belong to this class. In the symmetric case, when all players have the same strategy set, we design an algorithm that finds an optimal aggregated strategy and...
متن کاملBalanced environmental games
Focus is here on coalitional games among economic agents plagued by aggregate pollutions of diverse sorts. Defecting players presumably pollute more than others. Then, granted convex preferences and technologies, the core is proven nonempty. In fact, under natural assumptions, a specific, computable core solution comes in terms of shadow prices on the said aggregates. Such prices may, in large ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1982
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.7.3.476