Sciweavers

214 search results - page 19 / 43
» Finding Optimal Strategies for Imperfect Information Games
Sort
View
COLT
2008
Springer
13 years 9 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
JSAC
2008
140views more  JSAC 2008»
13 years 7 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
JSAC
2008
125views more  JSAC 2008»
13 years 7 months ago
Optimal Competitive Algorithms for Opportunistic Spectrum Access
We consider opportunistic spectrum access (OSA) strategies for a transmitter in a multichannel wireless system, where a channel may or may not be available and the transmitter must...
Nicholas B. Chang, Mingyan Liu
AAAI
2000
13 years 9 months ago
Combining Knowledge and Search to Solve Single-Suit Bridge
In problem solving, it is often important not only to find a solution but also to be able to explain it. We use the game of Bridge to illustrate how tactics, which formalise domai...
Ian Frank, David A. Basin, Alan Bundy
AI
2010
Springer
13 years 4 months ago
Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
James Pita, Manish Jain, Milind Tambe, Fernando Or...