Lexicographic allocations and extreme core payoffs: the case of assignment games

We consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We first investigate the general relationship between these allocations and obtain two hierarchies on the class of balanced games. Secondly, we focus on assignment games and sharpen some of these general relationship. Our main result is the coincidence of the sets of lemarals (vectors of lexicographic maxima over the set of dual coalitionally rational payoff vectors), lemacols (vectors of lexicographic maxima over the core) and extreme core points. As byproducts, we show that, similarly to the core and the coalitionally rational payoff set, also the dual coalitionally rational payoff set of an assignment game is determined by the individual and mixed-pair coalitions, and present an efficient and elementary way to compute these basic dual coalitional values. This provides a way to compute the Alexia value (the average of all lemacols) with no need to obtain the whole coalitional function of the dual assignment game.

Assignment Games with Externalities

We examine assignment games, wherematched pairs of firms and workers create some monetary value to distribute among themselves and the agents aim to maximize their payoff. In the majority of this literature, externalities - in the sense that a pair’s value depends on the pairing of the others - have been neglected. However, inmost applications a firm’s success depends on, say, the success of its rivals and suppliers. Thus, it is natural to ask how the classical results on assignment games are affected by the introduction of externalities? The answer is – dramatically. We find that (i) a problem may have no stable outcome, (ii) stable outcomes can be inefficient (not maximize total value), (iii) efficient outcomes can be unstable, and (iv) the set of stable outcomes may not form a lattice. We show that stable outcomes always exist if agents are "pessimistic." This is a knife-edge result: there are problems in which the slightest optimism by a single pair erases all stable outcomes.

The prisoners' dilemma, congestion games and correlation

Social dilemmas, in particular the prisoners' dilemma, are represented as congestion games, and within this framework soft correlated equilibria as introduced by Forgó F. (2010, A generalization of correlated equilibrium: A new protocol. Mathematical Social Sciences 60:186-190) is used to improve inferior Nash payoffs that are characteristic of social dilemmas. These games can be extended to several players in different ways preserving some important characteristics of the original 2-person game. In one of the most frequently studied models of the n-person prisoners' dilemma game we measure the performance of the soft correlated equilibrium by the mediation and enforcement values. For general prisoners' dilemma games the mediation value is ∞, the enforcement value is 2. This also holds for the class of separable prisoners’ dilemma games.

The structure of games

Computer Game Playing has been an active area of research since Samuel’s first Checkers player (Samuel 1959). Recently interest beyond the classic games of Chess and Checkers has led to competitions such as the General Game Playing competition, in which players have no beforehand knowledge of the games they are to play, and the Computer Poker Competition which force players to reason about imperfect information under conditions of uncertainty. The purpose of this dissertation is to explore the area of General Game Playing both specifically and generally. On the specific side, we describe the design and implementation of our General Game Playing system OGRE. This system includes an innovative method for feature extraction that helped it to achieve second and fourth place in two international General Game Playing competitions. On the more general side, we also introduce the Regular Game Language, which goes beyond current works to provide support for both stochastic and imperfect information games as well as the more traditional games.

The Dangerous Games of Fantasy, Lecture by Daína Chaviano

This flyer promotes the event "The Dangerous Games of Fantasy, Lecture by Daína Chaviano", cosponsored by the FIU Modern Languages Department and the Cuban Research Institute.

The Structure of Games

Computer Game Playing has been an active area of research since Samuel’s first Checkers player (Samuel 1959). Recently interest beyond the classic games of Chess and Checkers has led to competitions such as the General Game Playing competition, in which players have no beforehand knowledge of the games they are to play, and the Computer Poker Competition which force players to reason about imperfect information under conditions of uncertainty. The purpose of this dissertation is to explore the area of General Game Playing both specifically and generally. On the specific side, we describe the design and implementation of our General Game Playing system OGRE. This system includes an innovative method for feature extraction that helped it to achieve second and fourth place in two international General Game Playing competitions. On the more general side, we also introduce the Regular Game Language, which goes beyond current works to provide support for both stochastic and imperfect information games as well as the more traditional games.

Gaming learning analytics for serious games

Los juegos serios (o videojuegos educativos), se consideran una herramienta importante para la educación en el futuro. Por ello, se está invirtiendo mucho esfuerzo en el análisis de su corrección e idoneidad para alcanzar los objetivos educativos pretendidos. El campo de análisis de aprendizaje con juegos pretende proporcionar herramientas que verifiquen estas características mejorando la calidad y efectividad de los juegos serios. Para ello, se necesitan normalmente tres etapas: 1), monitorizar los datos de la interacción del jugador con el juego; 2), analizar esos datos recolectados; y 3), visualizar los resultados. En este contexto, hay algunos asuntos importantes a considerar: nivel de conocimiento del juego, receptor de las visualizaciones finales o cantidad y complejidad de los datos. Estas ideas se ponen en práctica con dos ejemplos de juegos serios centrándonos en las dos últimas etapas del proceso. Se realizan varios análisis y visualizaciones con ellos considerando los diferentes aspectos antes mencionados. Entre las conclusiones que se pueden extraer, destaca que, a pesar de haber algunos aspectos aún por mejorar, el análisis de aprendizaje con juegos es una herramienta esencial para muchos usuarios con una amplia variedad de intereses en juego serios.

Choreographer Twyla Tharp with with Olympic Champion Skater John Curry

General note: Title and date provided by Bettye Lane.

Colgate games 200 meter race at Madison Square Garden

General note: Title and date provided by Bettye Lane.

1960 Olympic three gold medal winner Wilma Rudolph with 14 year old daughter Djuana

General note: Title and date provided by Bettye Lane.

1980 track and field Olympic hopeful Evelyn Ashford

General note: Title and date provided by Bettye Lane.

US women's Olympic swimming team

General note: Title and date provided by Bettye Lane.

Choreographer Twyla Tharp with with Olympic Champion Skater John Curry

General note: Title and date provided by Bettye Lane.

Choreographer Twyla Tharp with with Olympic Champion Skater John Curry

General note: Title and date provided by Bettye Lane.