278 search results - page 19 / 56 » Quantitative Fairness Games |
ATAL
2001
Springer
15 years 5 months ago
2001
Springer
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
114
click to vote
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
111
Voted
PDPTA
2004
15 years 1 months ago
2004
File-sharing applications remain today the most representative and popular realization of the Peerto-Peer paradigm. Large objects receive an increasing amount of interest in such s...
89
Voted
CN
2006
15 years 15 days ago
2006
For over a decade, the Nash Bargaining Solution (NBS) concept from cooperative game theory has been used in networks to share resources fairly. Due to its many appealing propertie...
95
Voted
ACG
2006
Springer
15 years 6 months ago
2006
Springer
First, this paper introduces a new family of k-in-a-row games, Connect(m, n, k, p, q). In Connect(m, n, k, p, q), two players alternately place p stones on an m × n board in each ...