Tratamiento farmacológico del juego patológico

El tratamiento farmacológico del juego patológico conlleva una serie de dificultades que se pueden relacionar con la ausencia de un sustrato neurobiológico universalmente aceptado, altas tasas de abandonos y no cumplimentación del tratamiento, y ausencia de ensayos controlados que comparen diferentes modalidades de tratamiento en la misma población. El abordaje farmacológico del juego patológico se puede reaiizar desde diferentes perspectivas: desde un punto de vista etiopatonénico, desde el tiatumiento de-las patologías asociadas al juego patológico e incluso tratatando esta conducta como un síntoma de otra patología, como la mania. En las siguientes páginas 10s autores intentan revisar 10s diferentes fármacos propuestos en varios estudios. Los autores no recomiendan un tratamiento especifico para el juego patológico ya que existen diferentes posibilidades según las características del paciente.

Max-convex decompositions for cooperative TU games

We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with non-negative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of modular games is a set of generators of the distributive lattice of all cooperative TU games. Finally, we characterize zero-monotonic games using a strong max-convex decomposition

On the monotonic core

The monotonic core of a cooperative game with transferable utility (T.U.-game) is the set formed by all its Population Monotonic Allocation Schemes. In this paper we show that this set always coincides with the core of a certain game associated to the initial game.

On the dimension of the core of the assignment game

The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the dimension of the core of the assignment game. This result provides an easy procedure to determine the dimension of the core directly from the entries of the assignment matrix and shows that the dimension of the core is not as much determined by the number of optimal matchings as by their relative position in the assignment matrix.

Multi-sided Böhm-Bawerk assignment markets: the nucleolus and the core-center

En aquest treball mostrem que, a diferència del cas bilateral, per als mercats multilaterals d'assignació coneguts amb el nom de Böhm-Bawerk assignment games, el nucleolus i el core-center, i. e. el centre de masses del core, no coincideixen en general. Per demostrar-ho provem que donant un m-sided Böhm-Bawerk assignment game les dues solucions anteriors poden obtenir-se respectivament del nucleolus i el core-center d'un joc convex definit en el conjunt format pels m sectors. Encara més, provem que per calcular el nucleolus d'aquest últim joc només les coalicions formades per un jugador o m-1 jugadors són importants. Aquests resultats simplifiquen el càlcul del nucleolus d'un multi-sided ¿¿ohm-Bawerk assignment market amb un número molt elevat d'agents.

Vertical Syndication-Proof Competitive Prices in Multilateral Markets

[eng] A multi-sided Böhm-Bawerk assignment game (Tejada, to appear) is a model for a multilateral market with a finite number of perfectly complementary indivisible commodities owned by different sellers, and inflexible demand and support functions. We show that for each such market game there is a unique vector of competitive prices for the commodities that is vertical syndication-proof, in the sense that, at those prices, syndication of sellers each owning a different commodity is neither beneficial nor detrimental for the buyers. Since, moreover, the benefits obtained by the agents at those prices correspond to the nucleolus of the market game, we provide a syndication-based foundation for the nucleolus as an appropriate solution concept for market games. For different solution concepts a syndicate can be disadvantageous and there is no escape to Aumman’s paradox (Aumann, 1973). We further show that vertical syndicationproofness and horizontal syndication-proofness – in which sellers of the same commodity collude – are incompatible requirements under some mild assumptions. Our results build on a self-interesting link between multi-sided Böhm-Bawerk assignment games and bankruptcy games (O’Neill, 1982). We identify a particular subset of Böhm-Bawerk assignment games and we show that it is isomorphic to the whole class of bankruptcy games. This isomorphism enables us to show the uniqueness of the vector of vertical syndication-proof prices for the whole class of Böhm-Bawerk assignment market using well-known results of bankruptcy problems.

An axiomatization of the nucleolus of the assignment game

[cat] En el domini dels jocs bilaterals d’assignació, es presenta una axiomàtica del nucleolus com l´unica solució que compleix les propietats de consistència respecte del joc derivat definit per Owen (1992) i monotonia de les queixes dels sectors respecte de la seva cardinalitat. Com a conseqüència obtenim una caracterització geomètrica del nucleolus mitjançant una propietat de bisecció més forta que la que satisfan els punts del kernel (Maschler et al, 1979).

On the coincidence between the Shimomura's bargaining sets and the core

[cat] En l'article es dona una condició necessària per a que els conjunts de negociació definits per Shimomura (1997) i el nucli d'un joc cooperatiu amb utilitat transferible coincideixin. A tal efecte, s'introdueix el concepte de vectors de màxim pagament. La condició necessària consiteix a verificar que aquests vectors pertanyen al nucli del joc.

Regular population monotonic allocation schemes and the core

A subclass of games with population monotonic allocation schemes is studied, namelygames with regular population monotonic allocation schemes (rpmas). We focus on theproperties of these games and we prove the coincidence between the core and both theDavis-Maschler bargaining set and the Mas-Colell bargaining set

A note on the coincidence between Stackelberg and Nash equilibria in a differential game between government and firms

[cat] A Navas i Marín Solano es va demostrar la coincidència entre els equilibris de Nash i de Stackelberg per a una versi´o modificada del joc diferencial proposat por Lancaster (1973). Amb l’objectiu d’obtenir una solució interior, es van imposar restriccions importants sobre el valors dels paràmetres del model. En aquest treball estenem aquest resultat, en el límit en que la taxa de descompte és igual a zero, eliminant les restriccions i considerant totes les solucions possibles.

The maximun and the addition of assigment games

[cat] En el context dels mercats a dues bandes, considerem, en primer lloc, que els jugadors poden escollir on dur a terme les seves transaccions. Mostrem que el joc corresponent a aquesta situació, que es representa pel màxim d’un conjunt finit de jocs d’assignació, pot ser un joc no equilibrat. Aleshores proporcionem condicions per a l’equilibri del joc i, per aquest cas, analitzem algunes propietats del core del joc. En segon lloc, considerem que els jugadors poden fer transaccions en diversos mercats simultàniament i, llavors, sumar els guanys obtinguts. El joc corresponent, representat per la suma d’un conjunt finit de jocs d’assignació, és equilibrat. A més a més, sota certes condicions, la suma dels cores dels dos jocs d’assignació coincideix amb el core del joc suma.

Petróleo y gas en África: viejas realidades, nuevos escenarios

[cat] En els últims temps es parla molt del nou paper dels hidrocarburs d'Àfrica, fins i tot s'al·ludeix a un oil rush o a un african oil scramble , que inevitablement desembocarà en una confrontació bipolar entre la Xina i els Estats Units, pel control de les reserves de petroli del subsòl del continent africà. Així, el propòsit d'aquest text és, en primer lloc, realitzar una anàlisi descriptiva que ajudi a valorar la hipòtesi d'aquest african oil scramble. A continuación, amb les dades obtingudes, es discutirà sobre la possibilitat de que aquest fenomen desemboqui en un escenari de confrontació xinoamericana. Aquesta especulació ens durà a concloure que hi ha suficients indicis per a argumentar que el joc petrolífer africà podria desenvolupar-se en un escenari marcat per la multilateralitat.

Coalitionally monotonic set-solutions for cooperative TU games

A static comparative study on set-solutions for cooperative TU games is carried out. The analysis focuses on studying the compatibility between two classical and reasonable properties introduced by Young (1985) in the context of single valued solutions, namely core-selection and coalitional monotonicity. As the main result, it is showed that coalitional monotonicity is not only incompatible with the core-selection property but also with the bargaining-selection property. This new impossibility result reinforces the tradeoff between these kinds of interesting and intuitive economic properties. Positive results about compatibility between desirable economic properties are given replacing the core selection requirement by the core-extension property.

The assignment game: core bounds for mixed-pair coalitions

In the assignment game framework, we try to identify those assignment matrices in which no entry can be increased without changing the coreof the game. These games will be called buyer¿seller exact games and satisfy the condition that each mixed¿pair coalition attains the corresponding matrix entry in the core of the game. For a given assignment game, a unique buyerseller exact assignment game with the same core is proved to exist. In order to identify this matrix and to provide a characterization of those assignment games which are buyer¿seller exact in terms of the assignment matrix, attainable upper and lower core bounds for the mixed¿pair coalitions are found. As a consequence, an open question posed in Quint (1991) regarding a canonical representation of a ¿45o¿lattice¿ by means of the core of an assignment game can now be answered

The extreme core allocations of the assignment game

Although assignment games are hardly ever convex, in this paper a characterization of their set or extreme points of the core is provided, which is also valid for the class of convex games. For each ordering in the player set, a payoff vector is defined where each player receives his marginal contribution to a certain reduced game played by his predecessors. We prove that the whole set of reduced marginal worth vectors, which for convex games coincide with the usual marginal worth vectors, is the set of extreme points of the core of the assignment game