156 resultados para Jocs cooperatius (Matemàtica)


Relevância:

80.00% 80.00%

Publicador:

Resumo:

It is well known that, in distributions problems, fairness rarely leads to a single viewpoint (see, for instance, Young (1994)). In this context, this paper provides interesting bases that support the simple and commonly observed behavior of reaching intermediate agreements when two prominent distribution proposals highlight a discrepancy in sharing resources. Specifi cally, we formalize such a conflicting situation by associating it with a `natural' cooperative game, called bifocal distribution game, to show that both the Nucleolus (Schmeidler (1969)) and the Shapley value (Shapley (1953a)) agree on recommending the average of the two focal proposals. Furthermore, we analyze the interpretation of the previous result by means of axiomatic arguments. Keywords: Distribution problems, Cooperative games, Axiomatic analysis, Nucleolus, Shapley value. JEL Classi fication Numbers: C71, D63, D71.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this paper we prove that the Mas-Colell bargaining set coincides with the core for three-player balanced and superadditive cooperative games. This is no longer true without the superadditivity condition or for games with more than three-players. Furthermore, under the same assumptions, the coincidence between the Mas-Collel and the individual rational bargaining set (Vohra (1991)) is revealed. Keywords: Cooperative game, Mas-Colell bargaining set, balancedness, individual rational bargaining set. JEL classi fication: C71, D63, D71.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this paper we study the equity core (Selten, 1978) and compare it with the core. A payo vector is in the equity core if no coalition can divide its value among its members proportionally to a given weight system and, in this way, give more to each member than the amount he or she receives in the payo vector. We show that the equity core is a compact extension of the core and that, for non-negative games, the intersection of all equity cores with respect to all weights coincides with the core of the game. Keywords: Cooperative game, equity core, equal division core, core. JEL classi cation: C71

Relevância:

80.00% 80.00%

Publicador:

Resumo:

La meva investigació de metodologia qualitativa es base en observar el grau de consciència que tenen els alumnes de tercer de primària, de l’escola El Gegant del Rec, dels valors, les actituds i les normes que es treballen a través de jocs cooperatius, els quals estan presentats a partir d’una unitat de programació. El motiu del meu estudi és que l’educació en valors ha d’estar present a l’àrea d’Educació Física, ja que és un escenari molt potent i és molt interessant observar i potenciar als discents diferents actituds i valors a través de jocs i normes.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

On the domain of general assignment games (with possible reservation prices) the core is axiomatized as the unique solution satisfying two consistency principles: projection consistency and derived consistency. Also, an axiomatic characterization of the nucleolus is given as the unique solution that satisfies derived consistency and equal maximum complaint between groups. As a consequence, we obtain a geometric characterization of the nucleolus. Maschler et al. (1979) provide a geometrical characterization for the intersection of the kernel and the core of a coalitional game, showing that those allocations that lie in both sets are always the midpoint of certain bargaining range between each pair of players. In the case of the assignment game, this means that the kernel can be determined as those core allocations where the maximum amount, that can be transferred without getting outside the core, from one agent to his / her optimally matched partner equals the maximum amount that he / she can receive from this partner, also remaining inside the core. We now prove that the nucleolus of the assignment game can be characterized by requiring this bisection property be satisfied not only for optimally matched pairs but also for optimally matched coalitions. Key words: cooperative games, assignment game, core, nucleolus

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this note we introduce the Lorenz stable set and provide an axiomatic characterization in terms of constrained egalitarianism and projection consistency. On the domain of all coalitional games, we find that this solution connects the weak constrained egalitarian solution (Dutta and Ray, 1989) with their strong counterpart (Dutta and Ray, 1991)

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this paper we study network structures in which the possibilities for cooperation are restricted and can not be described by a cooperative game. The benefits of a group of players depend on how these players are internally connected. One way to represent this type of situations is the so-called reward function, which represents the profits obtainable by the total coalition if links can be used to coordinate agents' actions. The starting point of this paper is the work of Vilaseca et al. where they characterized the reward function. We concentrate on those situations where there exist costs for establishing communication links. Given a reward function and a costs function, our aim is to analyze under what conditions it is possible to associate a cooperative game to it. We characterize the reward function in networks structures with costs for establishing links by means of two conditions, component permanence and component additivity. Finally, an economic application is developed to illustrate the main theoretical result.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

For a family of reduced games satisfying a monotonicity property, we introduced the reduced equal split-off set, an extension of the equal split-off set (Branzei et. al, 2006), and study its relation with the core. Regardless of the reduction operation we consider, the intersection between both sets is either empty or a singleton containing the lexmax solution (Arin et al., 2008). We also provide a procedure for computing the lexmax solution for a class of games that includes games with large core (Sharkey, 1982). [JEL Classification: C71]

Relevância:

80.00% 80.00%

Publicador:

Resumo:

[spa] En el contexto de los juegos de asignación bilaterales, estudiamos el conjunto de matrices asociadas a mercados de asignación con el mismo nucleo. Se proporcionan condiciones sobre las entradas de la matriz que aseguran que los juegos de asignación asociados tienen el mismo núcleo. Se prueba que este conjunto de matrices que dan lugar al mismo núcleo forman un semirretículo con un número finito de elementos minimales y un único máximo. Se da una caracterización de estos elementos minimales. También se proporciona una condición suficiente para obtener un retículo.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

[spa] En el contexto de los juegos de asignación bilaterales, estudiamos el conjunto de matrices asociadas a mercados de asignación con el mismo nucleo. Se proporcionan condiciones sobre las entradas de la matriz que aseguran que los juegos de asignación asociados tienen el mismo núcleo. Se prueba que este conjunto de matrices que dan lugar al mismo núcleo forman un semirretículo con un número finito de elementos minimales y un único máximo. Se da una caracterización de estos elementos minimales. También se proporciona una condición suficiente para obtener un retículo.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

A minimum cost spanning tree (mcst) problem analyzes the way to efficiently connect individuals to a source when they are located at different places. Once the efficient tree is obtained, the question on how allocating the total cost among the involved agents defines, in a natural way, a confliicting claims situation. For instance, we may consider the endowment as the total cost of the network, whereas for each individual her claim is the maximum amount she will be allocated, that is, her connection cost to the source. Obviously, we have a confliicting claims problem, so we can apply claims rules in order to obtain an allocation of the total cost. Nevertheless, the allocation obtained by using claims rules might not satisfy some appealing properties (in particular, it does not belong to the core of the associated cooperative game). We will define other natural claims problems that appear if we analyze the maximum and minimum amount that an individual should pay in order to support the minimum cost tree. Keywords: Minimum cost spanning tree problem, Claims problem, Core JEL classification: C71, D63, D71.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

A class of three-sided markets (and games) is considered, where value is generated by pairs or triplets of agents belonging to different sectors, as well as by individuals. For these markets we analyze the situation that arises when some agents leave the market with some payoff To this end, we introduce the derived market (and game) and relate it to the Davis and Maschler (1965) reduced game. Consistency with respect to the derived market, together with singleness best and individual anti-monotonicity axiomatically characterize the core for these generalized three-sided assignment markets. These markets may have an empty core, but we define a balanced subclass, where the worth of each triplet is defined as the addition of the worths of the pairs it contains. Keywords: Multi-sided assignment market, Consistency, Core, Nucleolus. JEL Classification: C71, C78

Relevância:

80.00% 80.00%

Publicador:

Resumo:

This paper focuses on cooperative games with transferable utility. We propose the computation of two solutions, the Shapley value for n agents and the nucleolus with a maximum of four agents. The current approach is also focused on conflicting claims problems, a particular case of coalitional games. We provide the computation of the most well-known and used claims solutions: the proportional, the constrained equal awards, the constrained equal losses, the Talmud and the random arrival rules. Keywords: Cooperative game, Shapley value, nucleolus, claims problem, claims rule, bankruptcy.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

On the domain of cooperative transferable utility games, we investigate if there are single valued solutions that reconcile rationality, consistency and monotonicity (with respect to the worth of the grand coalition) properties. This paper collects some impossibility results on the combination of core selection with either complement or projected consistency, and core selection, max consistency and monotonicity. By contrast, possibility results show up when combining individual rationality, projected consistency and monotonicity.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

[cat] En aquest article es considera un problema de cooperació entre agents on cada agent realitza una contribució (diners, capital, treball, esforç) per tal d'obtenir un benefici comú a repartir. El repartiment proporcional respecte a les contribucions és una distribució que pertany al nucli del joc cooperatiu associat. A partir d'aquest model bàsic s'introdueix un agent extern que pot realitzar una determinada aportació que serveix per avaluar el potencial benefici de cada subcoalició d'agents si aquest nou agent finalment entrés. Aquesta anàlisi pot produir que el poder relatiu dels agents hagi variat. en concret s'avalua si la distribució proporcional és encara robusta des del punt de vista de la seva pertinença al conjunt de negociació. Amb aquest objectiu, analitzem el problema utilitzant el model de joc cooperatius amb estructura de coalició. Donat que, en general, la distribució proporcional, no pertany al conjunt de negociació, s'estudia una condició suficient per a que així sigui. També enunciem una condició necessària, i finalment es proposa una condició suficient que garanteix que el repartiment proporcional és la única distribució existent dins del conjunt de negociació.