356 search results - page 44 / 72 » Graph Games on Ordinals |
APPROX
2011
Springer
13 years 9 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
71
Voted
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another....
UAI
2008
14 years 11 months ago
2008
We present an algorithm that identifies the reasoning patterns of agents in a game, by iteratively examining the graph structure of its Multi-Agent Influence Diagram (MAID) repres...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study the dynamics of the Naming Game [Baronchelli et al., (2006) J. Stat. Mech.: Theory Exp. P06014] in empirical social networks. This stylized agentbased model captures essen...
102
click to vote
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...