904 search results - page 119 / 181 » Game Theory |
111
Voted
KI
2008
Springer
14 years 11 months ago
2008
Springer
The research aim of this paper is to represent everydaylife patterns of thought like "Because I know, what you think I think ..." by a process on a machine, which is inv...
122
Voted
IAT
2009
IEEE
14 years 10 months ago
2009
IEEE
We study an update operator for Coalition Logic to talk about the way players' strategic ability changes because of the moves of their opponents. We show its connection with D...
110
Voted
JUCS
2010
14 years 7 months ago
2010
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
APSEC
2007
IEEE
15 years 7 months ago
2007
IEEE
A customer reported problem (or Trouble Ticket) in software maintenance is typically solved by one or more maintenance engineers. The decision of allocating the ticket to one or m...
130
click to vote
SAGT
2010
Springer
14 years 11 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 ...