Sciweavers

1654 search results - page 288 / 331
» Games for Cognitive Agents
Sort
View
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
15 years 5 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
ATAL
2008
Springer
15 years 1 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...
ATAL
2010
Springer
15 years 28 days ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
ATAL
2010
Springer
15 years 28 days ago
On the limits of dictatorial classification
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
SELMAS
2004
Springer
15 years 5 months ago
A Software Framework for Automated Negotiation
If agents are to negotiate automatically with one another they must share a negotiation mechanism, specifying what possible actions each party can take at any given time, when nego...
Claudio Bartolini, Chris Preist, Nicholas R. Jenni...