Sciweavers

17 search results - page 3 / 4
» Extensive games with possibly unaware players
Sort
View
ICALP
2007
Springer
14 years 9 days ago
Minimum-Time Reachability in Timed Games
Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Pr...
MFCS
2010
Springer
13 years 4 months ago
Proof Systems and Transformation Games
We introduce Transformation Games (TGs), a form of coalitional game in which players are endowed with sets of initial resources, and have capabilities allowing them to derive certa...
Yoram Bachrach, Michael Zuckerman, Michael Wooldri...
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
13 years 10 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
ATAL
2006
Springer
13 years 10 months ago
Learning against multiple opponents
We address the problem of learning in repeated N-player (as opposed to 2-player) general-sum games. We describe an extension to existing criteria focusing explicitly on such setti...
Thuc Vu, Rob Powers, Yoav Shoham
INFOCOM
2007
IEEE
14 years 13 days ago
Non-Cooperative Multi-Radio Channel Allocation in Wireless Networks
— Channel allocation was extensively studied in the framework of cellular networks. But the emergence of new system concepts, such as cognitive radio systems, has brought this to...
Márk Félegyházi, Mario Cagalj...