Sciweavers

1503 search results - page 208 / 301
» Generalized Parity Games
Sort
View
ATAL
2006
Springer
15 years 5 months ago
Efficient agents for cliff-edge environments with a large set of decision options
This paper proposes an efficient agent for competing in Cliff Edge (CE) environments, such as sealed-bid auctions, dynamic pricing and the ultimatum game. The agent competes in on...
Ron Katz, Sarit Kraus
ATAL
2008
Springer
15 years 3 months ago
Programming agents as a means of capturing self-strategy
In this paper we report results of an extensive evaluation of people's ability to reproduce the strategies they use in simple real-life settings. Having the ability to reliab...
Michal Chalamish, David Sarne, Sarit Kraus
ATAL
2010
Springer
15 years 2 months ago
Modeling recursive reasoning by humans using empirically informed interactive POMDPs
Recursive reasoning of the form what do I think that you think that I think (and so on) arises often while acting rationally in multiagent settings. Several multiagent decision-ma...
Prashant Doshi, Xia Qu, Adam Goodie, Diana Young
ALMOB
2006
110views more  ALMOB 2006»
15 years 1 months ago
Computing distribution of scale independent motifs in biological sequences
The use of Chaos Game Representation (CGR) or its generalization, Universal Sequence Maps (USM), to describe the distribution of biological sequences has been found objectionable ...
Jonas S. Almeida, Susana Vinga
BMCBI
2002
131views more  BMCBI 2002»
15 years 1 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida