On some geometry and equivalence classes of normal form games

Equivalence classes of normal form games are defined using the geometryof correspondences of standard equilibiurm concepts like correlated, Nash,and robust equilibrium or risk dominance and rationalizability. Resultingequivalence classes are fully characterized and compared across differentequilibrium concepts for 2 x 2 games. It is argued that the procedure canlead to broad and game-theoretically meaningful distinctions of games aswell as to alternative ways of viewing and testing equilibrium concepts.Larger games are also briefly considered.

Multiple prisoner's dilemma games with (out) an outside option: An experimental study

Experiments in which subjects play simultaneously several finite prisoner's dilemma supergames with and without an outside optionreveal that: (i) subjects use probabilistic start and endeffect behaviour, (ii) the freedom to choose whether to play the prisoner's dilemma game enhances cooperation, (iii) if the payoff for simultaneous defection is negative, subjects' tendency to avoid losses leads them to cooperate; while this tendency makes them stick to mutual defection if its payoff is positive.

An axiomatization of the prekernel of nontransferable utility games

We characterize the prekernel of NTU games by means of consistency,converse consistency, and five axioms of the Nash type on bilateral problems.The intersection of the prekernel and the core is also characterized with thesame axioms over the class of games where the core is nonempty.

Rational reasoning or adaptive behavior? Evidence from two-person beauty contest games

Many experiments have shown that human subjects do not necessarily behave in line with game theoretic assumptions and solution concepts. The reasons for this non-conformity are multiple. In this paper we study the argument whether a deviation from game theory is because subjects are rational, but doubt that others are rational as well, compared to the argument that subjects, in general, are boundedly rational themselves. To distinguish these two hypotheses, we study behavior in repeated 2-person and many-person Beauty-Contest-Games which are strategically different from one another. We analyze four different treatments and observe that convergence toward equilibrium is driven by learning through the information about the other player s choice and adaptation rather than self-initiated rational reasoning.

Equilibrium selection through incomplete information in coordination games: An experimental study

We perform an experiment on a pure coordination game with uncertaintyabout the payoffs. Our game is closely related to models that have beenused in many macroeconomic and financial applications to solve problemsof equilibrium indeterminacy. In our experiment each subject receives anoisy signal about the true payoffs. This game has a unique strategyprofile that survives the iterative deletion of strictly dominatedstrategies (thus a unique Nash equilibrium). The equilibrium outcomecoincides, on average, with the risk-dominant equilibrium outcome ofthe underlying coordination game. The behavior of the subjects convergesto the theoretical prediction after enough experience has been gained. The data (and the comments) suggest that subjects do not apply through"a priori" reasoning the iterated deletion of dominated strategies.Instead, they adapt to the responses of other players. Thus, the lengthof the learning phase clearly varies for the different signals. We alsotest behavior in a game without uncertainty as a benchmark case. The gamewith uncertainty is inspired by the "global" games of Carlsson and VanDamme (1993).

Elicited beliefs and social information in modified dictator games: What do dictators believe other dictators do?

We use subjects actions in modified dictator games to perform a within-subject classification ofindividuals into four different types of interdependent preferences: Selfish, Social Welfaremaximizers, Inequity Averse and Competitive. We elicit beliefs about other subjects actions inthe same modified dictator games to test how much of the existent heterogeneity in others actions is known by subjects. We find that subjects with different interdependent preferences infact have different beliefs about others actions. In particular, Selfish individuals cannotconceive others being non-Selfish while Social Welfare maximizers are closest to the actualdistribution of others actions. We finally provide subjects with information on other subjects actions and re-classify individuals according to their (new) actions in the same modified dictatorgames. We find that social information does not affect Selfish individuals, but that individualswith interdependent preferences are more likely to change their behavior and tend to behavemore selfishly.

Ambiguity in election games

We construct a model in which the ambiguity of candidates allows them toincrease the number of voters to whom they appeal when voters have intense preferences for one of the alternatives available. An ambiguous candidate may offer voters with different preferences the hope that their most preferred alternative will be implemented. We find conditions under which ambiguous strategies are chosen in equilibrium. These conditions include the case in which there is an outcome that is a majority winner against all other outcomes but is not the most preferred outcome for a majority of voters. It is shown that if the number of candidates or parties increases, ambiguity will not be possible in equilibrium, but a larger set of possible policies increases the chance that at least one candidate will choose to be ambiguous in equilibrium.

Generic finiteness of equilibrium payoffs for bimatrix games

It is shown that in any affine space of payoff matrices the equilibriumpayoffs of bimatrix games are generically finite.

On p-beauty contest integer games

In this paper we provide a full characterization of the pure-strategyNash Equilibria for the p-Beauty Contest Game when we restrict player schoices to integer numbers. Opposed to the case of real number choices,equilibrium uniqueness may be lost depending on the value of p and thenumber of players: in particular, as p approaches 1 any symmetric profileconstitutes a Nash Equilibrium. We also show that any experimental p-BeautyContest Game can be associated to a game with the integer restriction andthus multiplicity of equilibria becomes an issue. Finally, we show thatin these games the iterated deletion of weakly dominated strategies maynot lead to a single outcome while the iterated best-reply process alwaysdoes (though the outcome obtained depends on the initial conditions).

Causal assessment in finite extensive-form games

Two finite extensive-form games are empirically equivalent when theempirical distribution on action profiles generated by every behaviorstrategy in one can also be generated by an appropriately chosen behaviorstrategy in the other. This paper provides a characterization ofempirical equivalence. The central idea is to relate a game's informationstructure to the conditional independencies in the empirical distributionsit generates. We present a new analytical device, the influence opportunitydiagram of a game, describe how such a diagram is constructed for a givenextensive-form game, and demonstrate that it provides a complete summaryof the information needed to test empirical equivalence between two games.

Stochastic evolution of rules for playing normal form games

The evolution of boundedly rational rules for playing normal form games is studied within stationary environments ofstochastically changing games. Rules are viewed as algorithms prescribing strategies for the different normal formgames that arise. It is shown that many of the folk results of evolutionary game theory typically obtained witha fixed game and fixed strategies carry over to the present case. The results are also related to recent experimentson rules and games.

Iowa Department of Transportation Fiscal Year 2008 Report of Savings by Using Video Conferencing Through Iowa Communications Network to the Iowa General Assembly Pursuant to Iowa Code § II 84 Acts and Joint Resolutions Enacted at the 1994 Regular Session of the 75th General Assembly of the State of Iowa Iowa Code §8D.10 Report of Savings by State Agencies

Iowa Code § 8D.10 requires certain state agencies prepare an annual report to the General Assembly certifying the identified savings associated with that state agency’s use of the Iowa Communications Network (ICN). This report covers estimated cost savings related to video conferencing via ICN for the Iowa Department of Transportation (DOT). In FY 2008, the DOT did not conduct any sessions utilizing ICN’s video conferencing system. Therefore, no cost savings were calculated for this report.

Video-assisted right supradiaphragmatic thoracic duct ligation for non traumatic recurrent chylothorax

Introduction : Un chylothorax est une pathologie comprenant des manifestations respiratoires, nutritionnelles et immunologiques. La récidive du chylothorax ou l'échec du traitement conservateur imposent un traitement chirurgical. Ce travail rapporte notre expérience de ligature supra-diaphragmatique, vidéo-assistée du canal thoracique, pour chylothorax récurrent non traumatique. Patients et méthodes : Entre 1999 et 2004, nous avons recensé six observations (quatre du côté droit, un du côté gauche et un bilateral) Le chylothorax s'est développé chez trois patients traités par radio et chimiothérapie pour tumeur (deux lymphomes et une tumeur du sein) un dans le contexte d'une lymphangioléiomatose et un après greffe cardiaque. Résultats : Les patients ont bénéficié sous anesthésie générale, d'une ligature du canal thoracique supra-diaphragmatique, vidéo-assistée. Le temps opératoire moyen a été de 102 minutes. Le chylothorax a régressé chez cinq des six patients en sept jours. Un patient a été repris par thoracotomie droite au huitième jour pour chylothorax persistant. Dans la phase post-opératoire, un patient a développé une détresse respiratoire nécessitant une ventilation mécanique. Un autre patient a présenté un chylopéritoine important traité par un stent de Le Veen®. Le séjour moyen a été de quatorze jours sans mortalité péri-opératoire. Conclusion : Le traitement du chylothorax non traumatique récurrent est, en première intention, un traitement médical. En cas de récidive ou d'échec du traitement conservateur, le traitement chirurgical par ligature du canal thoracique supra- diaphragmatique, vidéo-assistée, permet de traiter avec succès le chylothorax récurrent non traumatique. -- Background: Chylothorax is an uncommon disorder with respiratory, nutritional and immunological manifestations. Surgical management is indicated in case of recurrence or failure after conservative treatment. We report our experience with video-assisted right-sided supradiaphrag¬matic thoracic duct ligation for non-traumatic, non-postoperative persistent or recurrent chylothorax. Patients and methods: The medical records of six patients operated at our institution between 1999 and 2004 were retrospectively reviewed. A right-sided chylothorax was found in four patients, a left-sided in one, and a bilateral in one. Three patients developed chylothorax after chemotherapy and chest irradiation for malignant diseases (lymphoma in two patients and breast cancer in one), one in the context of lymphangioleiomyomatosis, one due to a non-diagnosed lymphoma, and one after heart transplantation. Results: The mean operative time was 102 min, with an average length of hospital stay of 14 days. Persistent cessation of chylous effusion within 7 days after surgery was observed in 5/6 patients without recurrence during a mean follow-up time of 41 months. One patient with undiagnosed mediastinal lymphoma required re-operation and thoracic duct ligation on day 8 by right-sided thoracotomy due to persistent chylothorax. No 30-day mortality was recorded. Two patients presented postoperative complications including respiratory insufficiency requiring mechanical ventilation in one, and chylous ascites development requiring peritoneo-venous LeVeen shunting in one patient. Conclusions: Recurrent or persistent non-traumatic chylothorax may be successfully treated by video-assisted right supradiaphragmatic thoracic duct ligation.

Copresence video conference mediated interaction

Abstract

Performance evaluation of MPEG-4 Video encoder on Adres

Actualment un típic embedded system (ex. telèfon mòbil) requereix alta qualitat per portar a terme tasques com codificar/descodificar a temps real; han de consumir poc energia per funcionar hores o dies utilitzant bateries lleugeres; han de ser el suficientment flexibles per integrar múltiples aplicacions i estàndards en un sol aparell; han de ser dissenyats i verificats en un període de temps curt tot i l’augment de la complexitat. Els dissenyadors lluiten contra aquestes adversitats, que demanen noves innovacions en arquitectures i metodologies de disseny. Coarse-grained reconfigurable architectures (CGRAs) estan emergent com a candidats potencials per superar totes aquestes dificultats. Diferents tipus d’arquitectures han estat presentades en els últims anys. L’alta granularitat redueix molt el retard, l’àrea, el consum i el temps de configuració comparant amb les FPGAs. D’altra banda, en comparació amb els tradicionals processadors coarse-grained programables, els alts recursos computacionals els permet d’assolir un alt nivell de paral•lelisme i eficiència. No obstant, els CGRAs existents no estant sent aplicats principalment per les grans dificultats en la programació per arquitectures complexes. ADRES és una nova CGRA dissenyada per I’Interuniversity Micro-Electronics Center (IMEC). Combina un processador very-long instruction word (VLIW) i un coarse-grained array per tenir dues opcions diferents en un mateix dispositiu físic. Entre els seus avantatges destaquen l’alta qualitat, poca redundància en les comunicacions i la facilitat de programació. Finalment ADRES és un patró enlloc d’una arquitectura concreta. Amb l’ajuda del compilador DRESC (Dynamically Reconfigurable Embedded System Compile), és possible trobar millors arquitectures o arquitectures específiques segons l’aplicació. Aquest treball presenta la implementació d’un codificador MPEG-4 per l’ADRES. Mostra l’evolució del codi per obtenir una bona implementació per una arquitectura donada. També es presenten les característiques principals d’ADRES i el seu compilador (DRESC). Els objectius són de reduir al màxim el nombre de cicles (temps) per implementar el codificador de MPEG-4 i veure les diferents dificultats de treballar en l’entorn ADRES. Els resultats mostren que els cícles es redueixen en un 67% comparant el codi inicial i final en el mode VLIW i un 84% comparant el codi inicial en VLIW i el final en mode CGA.