2024 search results - page 371 / 405 » The cost of social agents |
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in ...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
AAAI
2006
14 years 11 months ago
2006
Identifying intrinsic structures in large networks is a fundamental problem in many fields, such as engineering, social science and biology. In this paper, we are concerned with c...
74
Voted
WSC
2004
14 years 11 months ago
2004
This paper describes the application of data farming techniques (Brandstein and Horne 1998) to explore various aspects of coevolutionary dynamics (McKelvey 2002) in organization s...
102
click to vote
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...