198 search results - page 36 / 40 » Anytime Bounded Rationality |
86
Voted
WG
2000
Springer
15 years 4 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
92
Voted
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Distributed allocation mechanisms rely on the agents' autonomous (and supposedly rational) behaviour: states evolve as a result of agents contracting deals and exchanging res...
100
Voted
COCOON
2005
Springer
15 years 2 months ago
2005
Springer
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The...
106
Voted
ESA
2008
Springer
15 years 2 months ago
2008
Springer
A truthful mechanism consists of an algorithm augmented with a suitable payment function which guarantees that the "players" cannot improve their utilities by "chea...
80
Voted
EUSFLAT
2007
15 years 2 months ago
2007
Cooperative games under precedence constraints have been introduced by Faigle and Kern [1] , [4] as a generalization of classical cooperative games. An important notion in coopera...