674 search results - page 98 / 135 » Preferences in Game Logics |
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
AAI
2006
13 years 7 months ago
2006
In the analysis of a newspaper page an important step is the clustering of various text blocks into logical units, i.e., into articles. We propose three algorithms based on text p...
4OR
2004
13 years 7 months ago
2004
Abstract In this paper we address the problem of aggregating outranking statements from multiple preference criteria of ordinal significance. The concept of ordinal concordance of ...
DALT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper is concerned with designing architectures for rational agents. In the proposed architecture, agents have belief bases that are theories in a multi-modal, highe...
ARGMAS
2004
Springer
14 years 1 months ago
2004
Springer
Negotiation can be conceived as the exchange of messages among self-interested agents in order to settle on an agreement over a given issue. They decide which messages to send acco...