904 search results - page 73 / 181 » Game Theory |
128
Voted
ICAIL
2007
ACM
15 years 8 months ago
2007
ACM
Argumentation is modelled as a game where the payoffs are measured in terms of the probability that the claimed conclusion is, or is not, defeasibly provable, given a history of a...
132
click to vote
DCG
1999
15 years 3 months ago
1999
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
143
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
143
Voted
FMCO
2004
Springer
15 years 9 months ago
2004
Springer
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we ...
SIAMDM
2010
15 years 2 months ago
2010
Let ϕ = (1 + √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of ϕ and ϕ2. We...