Sciweavers

1688 search results - page 109 / 338
» The Complexity of Rationalizing Matchings
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 7 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
NIPS
2003
15 years 7 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
164
Voted
ICMAS
1998
15 years 7 months ago
Principles of Trust for MAS: Cognitive Anatomy, Social Importance, and Quantification
After arguing about the crucial importance of trust for Agents and MAS, we provide a definition of trust both as a mental state and as a social attitude and relation. We present t...
Cristiano Castelfranchi, Rino Falcone
AAAI
1996
15 years 7 months ago
A Kernel-Oriented Model for Coalition-Formation in General Environments: Implementation and Results
In this paper we present a model for coalition formation and payo distribution in general environments. We focus on a reduced complexity kernel-oriented coalition formation model,...
Onn Shehory, Sarit Kraus
SIGDIAL
2010
15 years 3 months ago
Parameter estimation for agenda-based user simulation
This paper presents an agenda-based user simulator which has been extended to be trainable on real data with the aim of more closely modelling the complex rational behaviour exhib...
Simon Keizer, Milica Gasic, Filip Jurcícek,...