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 Security Challenges for the 2016 Rio de Janeiro Olympic Games

Brazilians greeted the long-awaited decision of making Rio de Janeiro the host of the 2016 Olympic Games with tremendous exhilaration. Although Rio’s fantastic natural beauty certainly added to its attraction in hosting the games, its alarming rates of urban crime and violence largely associated with drug trafficking immediately triggered worldwide criticism, and put at issue its ability to guarantee the security for the games. Brazilians have been vying for a position as an emerging global economy and understand the importance of the Games for international prestige. This makes the stakes very high when hosting the Olympic Games in the wake of the 2014 Soccer World Cup, which will also be held in Brazil. This paper explores these criticisms and assesses Rio’s ability to prepare for this important event. The paper further explores the consensus that Brazilians will be more equipped to address actions taken by organized crime capable of affecting the Olympic Games than to face a terrorist attack. Brazil – and Rio – does not figure in the “terrorism map” as a region particularly linked to terrorism. Aside from uncorroborated suspicions of activities by terrorist organizations on the Tri-Border region (Argentina, Brazil, and Paraguay), Brazil does not elicit many concerns regarding terrorism.1 Yet, there is no way to guarantee that terrorist organizations will not try to make use of the 2016 Rio Olympic Games to advance their agenda. This being in mind, Rio and Brazil in general face a long road ahead to prepare, prevent, protect and respond to a possible terrorist attack during the 2016 Olympics. It is clear that prevention and preparation towards potential threats to the Games must necessarily include cooperation and exchange of best practices with other countries. 1 U.S. Department of State has confirmed that this area may have been used to transport weapons and conduct financial affairs in the past. This type of activity has been made more difficult with the fortification of border controls in more recent times.

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.

Implementazione e valutazione delle prestazioni di algoritmi di localizzazione Indoor basati su dispositivi Beacon

Questo elaborato di tesi ha lo scopo di illustrare un'applicazione realizzata per dispositivi Android in grado di localizzare l'utente all'interno di un ambiente indoor sfruttando l'utilizzo dei Beacon e dare una valutazione dei risultati ottenuti. L'utente potrà registrare i dispositivi Beacon in suo possesso all'interno dell'applicazione, caricare la planimetria di un ambiente e configurarlo indicando esattamente quale Beacon si trova in una determinata posizione. Infine potrà scegliere quale tra i tre algoritmi implementati (Prossimità, Triangolazione e Fingerprinting) utilizzare per visualizzare la propria posizione sulla mappa. I tre algoritmi sono stati sottoposti a vari test che hanno permesso di analizzare le differenze tra di essi in termini di accuratezza e le performance generali dell'applicativo.

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.

Colgate games 200 meter race at Madison Square Garden

General note: Title and date provided by Bettye Lane.

West Point Basketball team between games

General note: Title and date provided by Bettye Lane.

Quantum pseudo-telepathy games

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Verification of the indoor gps system by comparison with points calibrated using a network of laser tracker measurements

This paper details a method of determining the uncertainty of dimensional measurement for a three dimensional coordinate measurement machine. An experimental procedure was developed to compare three dimensional coordinate measurements with calibrated reference points. The reference standard used to calibrate these reference points was a fringe counting interferometer with the multilateration technique employed to establish three dimensional coordinates. This is an extension of the established technique of comparing measured lengths with calibrated lengths. Specifically a distributed coordinate measurement device was tested which consisted of a network of Rotary-Laser Automatic Theodolites (R-LATs), this system is known commercially as indoor GPS (iGPS). The method was found to be practical and able to establish that the expanded uncertainty of the basic iGPS system was approximately 1 mm at a 95% confidence level. © Springer-Verlag Berlin Heidelberg 2010.