Games. Com

Followers

Following

Public Views

Address: Israel

less

Maurizio Forte

Duke University

Enrico Cirelli

Università di Bologna

Saygin Abdikan

Hacettepe University

Fusun Balik Sanli

Yildiz Technical University

Laurent Matthey

Université de Genève

Viacheslav Kuleshov

Stockholm University

Gérard-François DUMONT

Université Paris-Sorbonne (Paris IV)

Luc Gwiazdzinski

Université Toulouse II Jean Jaurès

Daniela A . Festa

EHESS-Ecole des hautes études en sciences sociales

Emirhamza Bilgin

Bogazici University

Interests

Uploads

Papers by Games. Com

Analyzing Complex Strategic Interactions in Multi-Agent Systems

We develop a model for analyzing complex games with re- peated interactions, for which a full gam... more We develop a model for analyzing complex games with re- peated interactions, for which a full game-theoretic analy- sis is intractable. Our approach treats exogenously specified, heuristic strategies, rather than the atomic actions, as prim- itive, and computes a heuristic-payoff table specifying the expected payoffs of the joint heuristic strategy space. We analyze two games based on (i) automated dynamic

Visualising Dynamic Programming

Towards a Stochastic Model for Integrated Security and Dependability Evaluation

We present a new approach to integrated security and dependability evaluation, which is based on ... more We present a new approach to integrated security and dependability evaluation, which is based on stochastic modelling techniques. Our proposal aims to provide operational measures of the trustworthiness of a system, regardless if the underlying failure cause is intentional or not. By viewing system states as elements in a stochastic game, we can compute the probabilities of expected attacker behavior, and thereby be able to model attacks as transitions between system states. The proposed game model is based on a rewardand cost concept. A section of the paper is devoted to the demonstration of how the expected attacker behavior is affected by the parameters of the game. Our model opens up for use traditional Markov analysis to make new types of probabilistic predictions for a system, such as its expected time to security failure.

Download

ACL: Specification, Design and Analysis All Based on Commitments

In recent years, social commitment based approaches have been proposed to solve problems issuing ... more In recent years, social commitment based approaches have been proposed to solve problems issuing from previous mentalistic based semantics for agent communication languages. This paper follows the same line of thought since it presents a dialogue game based agent communication language (called DIAGAL) which allows agents to manipulate the public layer of social commitments through dialogue, by creating, cancelling, . . . , updating their social commitments. Then we show how we can study the commitments dynamic to model agent dialogue and we present some metrics that can be used to evaluate the quality of dialogue. Next, we use an example (summer festival organization) to show how DIAGAL can be used in analyzing and modelling automated conversations in offices. Finally, we present the results and analysis of the summer festival simulations that we realized through our dialogue game simulator (DGS).

Download

Learning English through Serious Games - Reflections on Teacher and Learner Performance

In this paper I shall discuss the potential of educational games (Serious Games) for teaching and... more In this paper I shall discuss the potential of educational games (Serious Games) for teaching and learning English online focusing on user engagement, performance and design. The paper builds on data from a research project, Serious Games on a Global Market Place in which a platform for learning English as a foreign language in primary school (www.Mingoville.com) has been studied

Discovering Theorems in Game Theory: Two-Person Games with Unique Nash Equilibria

In this paper we provide a logical framework for using computers to discover theorems in (two-per... more In this paper we provide a logical framework for using computers to discover theorems in (two-person finite) games in strategic form, and apply it to discover classes of games that have unique (pure-strategy) Nash equilibria. We consider all possible classes of games that can be expressed by a conjunction of two binary clauses, and our program re-discovered Kats and Thisse's class of weakly unilaterally competitive two-person games, and came up with several other classes of games that have unique Nash equilibria. It also came up with new classes of strict games that have unique Nash equilibria, where a game is strict if for each player different profiles have different payoffs. Partly motivated by these findings, we also (manually) prove a result that says that a strict game has a unique Nash equilibrium iff it is best-response equivalent to a strictly competitive game.

Download

Use of the Hollywood Impact Base Tnd Standard Stationary Base to Reduce Slidin and Base-Running Injuries in Baseball and Softball

American Journal of Sports Medicine, 1994

To determine if the use of the Hollywood Impact Base would significantly reduce the frequency of ... more To determine if the use of the Hollywood Impact Base would significantly reduce the frequency of sliding and base-running injuries to baseball and softball players, we recorded injury information for several teams who used these bases and standard stationary bases. The investigators, under the direction of the Central Michigan University team physician, verified each recorded incident by contacting the injured participant. The sample included interscholastic, intercollegiate, recreational, and intramural softball and baseball teams. There were 33,153 athlete-exposures with the Hollywood Impact Base in use and 3999 with the standard stationary base over a 2-year period (1990 and 1991). There were four injuries that could be directly attributed to the standard stationary base and only one injury that could be attributed to the Hollywood Impact Base. The results (t = -1.94, P &lt; 0.05) verify that using the Hollywood Impact Base significantly reduced the frequency of sliding and base-running injuries. The Hollywood Impact Base injury rate of 0.08% per game compares favorably with the reported breakaway base injury rate. The results of our study verify that the Hollywood Impact Base is similarly effective in reducing the risk of base-related injuries.

Non-cooperative Facility Location and Covering Games

Theoretical Computer Science, 2006

We study a general class of non-cooperative games coming from combinatorial covering and facility... more We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programming formulation. Each player wants to satisfy a subset of the constraints. Variables represent resources, which are available in costly integer units and must be bought. The cost can be shared arbitrarily between players. Once a unit is bought, it can be used by all players to satisfy their constraints. In general the cost of pure-strategy Nash equilibria in this game can be prohibitively high, as both prices of anarchy and stability are in Θ(k). In addition, deciding the existence of pure Nash equilibria is NP-hard. These results extend to recently studied single-source connection games. Under certain conditions, however, cheap Nash equilibria exist: if the integrality gap of the underlying integer program is 1 and in the case of single constraint players. In addition, we present algorithms that compute cheap approximate Nash equilibria in polynomial time.

Download

Recombinable Game Mechanics for Automated Design Support

Systems that provide automated game-design supportwhether fully automated game generators, or too... more Systems that provide automated game-design supportwhether fully automated game generators, or tools to assist human designers-must be able to maintain a representation of a game design and add or remove game mechanics to support incrementally modifying the game. The system should then be able to reason about the design to support the designer. For example, it might point out that the set of mechanics makes the game unwinnable; or that there's only one complex possible way to beat the game; or that some room is impossible to get to. In addition, the same representation should be actually playable as a game. Existing game representations encode a fairly narrow range of games, most commonly symmetric board games; these representations are also difficult to extend or revise. We propose an architecture based on the event calculus, a logical representation designed for reasoning about time in an elaboration-tolerant way, meaning that designs can be changed by adding or removing sets of axioms rather than modifying brittle hard-coded representations. The resulting game design is a declarative specification in formal logic, so can be critiqued by making queries that are answered through logical inference. Since it specifies the game's simulation rules, it may be executed by logical inference as well; if symbols specifying input and graphical representation are appropriately mapped to input devices and a graphical display, the same declarative representation can be executed as a fully interactive, graphical game. We describe how to organize a library of game-design mechanics using this event-calculus framework, and describe a simple tile-based game, showing how it can be easily modified, critiqued and debugged, and played.

Download

Analyzing Complex Strategic Interactions in Multi-Agent Systems