Sciweavers

179 search results - page 10 / 36
» Asynchronous Congestion Games
Sort
View
CONCUR
2007
Springer
15 years 5 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
CEC
2007
IEEE
15 years 6 months ago
Asynchronous spatial evolutionary games: spatial patterns, Diversity and Chaos
— Over the past 50 years, much attention has been given to the Prisoner’s Dilemma as a metaphor for problems surrounding the evolution and maintenance of cooperative and altrui...
David Newth, David Cornforth
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
15 years 5 months ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 1 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
SIROCCO
2004
15 years 1 months ago
Two-Hop Virtual Path Layout in Tori
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a...
Sébastien Choplin, Lata Narayanan, Jaroslav...