Concept

Game tree

Related publications (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Multi-Agent Learning for Resource Allocation Problems

Ludek Cigler

We analyze resource allocation problems where N independent agents want to access C resources. Each resource can be only accessed by one agent at a time. In order to use the resources efficiently, the agents need to coordinate their access. We focus on dec ...

EPFL2013

Modeling an America's Cup Regatta as a Sequential Stochastic Game

Jean-Benoît Rossel

The main objective of this thesis is to model a regatta in the America’s Cup, and more precisely the first leg of the race, where the two competing sailboats have to move upwind. During the race, each crew attempts to be the first to reach the end of this ...

EPFL2013

A Robust Meta-Game for Climate Negotiations

Marc Vielle, Frédéric Louis François Babonneau, Alain Haurie

This paper deals with an application of the robust equilibrium concept in game theory to the assessment of the possible international agreement on climate that could be achieved in the conference of the parties negotiations organized by the UNFCCC. It is s ...

Springer Verlag2013

A Speculation-Friendly Binary Search Tree

Vincent Gramoli

We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-speculative) accesses to have a bounded complexity. Researchers tried to evaluate t ...

Assoc Computing Machinery2012

Locating the Source of Diffusion in Large-Scale Networks

Martin Vetterli, Patrick Thiran, Pedro Pereira Correia Pinto

How can we localize the source of diffusion in a complex network? Due to the tremendous size of many real networks---such as the Internet or the human social graph---it is usually infeasible to observe the state of all nodes in a network. We show that it i ...

American Physical Society2012

Game-theoretic Models of Web Credibility

Karl Aberer

Research on Web credibility assessment can significantly benefit from new models that are better suited for evaluation and study of adversary strategies. Currently employed models lack several important aspects, such as the explicit modeling of Web content ...

ACM2012

Collaborative Location Privacy with Rational Users

Jean-Pierre Hubaux, Mathias Jacques Jean-Marc Humbert, Reza Shokri, Francisco De Meneses Neves Ramos Dos Santos

Recent smartphones incorporate embedded GPS devices that enable users to obtain geographic information about their surroundings by providing a location-based service (LBS) with their current coordinates. However, LBS providers collect a significant amount ...

Springer-Verlag Berlin2011

Strategy construction for parity games with imperfect information

Laurent Doyen

We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding ...

2010

Strategy Construction for Parity Games with Imperfect Information

Laurent Doyen

We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e. to determine the winning regions of players and corresponding winning strategi ...

2008

Algorithms for Interface Synthesis

Vasu Singh, Dirk Thilo Beyer

A temporal interface for a software component is a ﬁnite automaton that speciﬁes the legal sequences of calls to functions that are provided by the component. We compare and evaluate three different algorithms for automatically extracting temporal interfac ...

Springer2007