Sciweavers

164 search results - page 3 / 33
» Selecting Robust Strategies Based on Abstracted Game Models
Sort
View
ICCBR
2009
Springer
13 years 11 months ago
Conceptual Neighborhoods for Retrieval in Case-Based Reasoning
Abstract. We present a case-based reasoning technique based on conceptual neighborhoods of cases. The system applies domain knowledge to the case retrieval process in the form of r...
Ben G. Weber, Michael Mateas
TBILLC
2007
Springer
13 years 11 months ago
Implicatures of Irrelevant Answers and the Principle of Optimal Completion
Abstract. In this paper, we present a game theoretic account of a subclass of ‘relevance’ implicatures arising from irrelevant answers. We show that these phenomena can be expl...
Anton Benz
IWANN
2001
Springer
13 years 9 months ago
A Penalization Criterion Based on Noise Behaviour for Model Selection
Complexity-penalization strategies are one way to decide on the most appropriate network size in order to address the trade-off between overfitted and underfitted models. In this p...
Joaquín Pizarro Junquera, Pedro Galindo Ria...
FSTTCS
2007
Springer
13 years 11 months ago
A Theory for Game Theories
Abstract. We explain a double-category (of positions and plays) attached to the theory of HOgames (those with the so-called switching condition [7]) from which the category of aren...
Michel Hirschowitz, André Hirschowitz, Tom ...
AI
2010
Springer
13 years 1 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...