Sciweavers

294 search results - page 30 / 59
» The complexity of computing a Nash equilibrium
Sort
View
ATAL
2005
Springer
15 years 3 months ago
Game theoretic Golog under partial observability
We present the agent programming language POGTGolog, which combines explicit agent programming in Golog with game-theoretic multi-agent planning in a special kind of partially obs...
Alberto Finzi, Thomas Lukasiewicz
CORR
2008
Springer
172views Education» more  CORR 2008»
14 years 9 months ago
Altruism in Congestion Games
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...
Martin Hoefer, Alexander Skopalik
DSN
2011
IEEE
13 years 9 months ago
Applying game theory to analyze attacks and defenses in virtual coordinate systems
—Virtual coordinate systems provide an accurate and efficient service that allows hosts on the Internet to determine latency to arbitrary hosts based on information provided by ...
Sheila Becker, Jeff Seibert, David Zage, Cristina ...
ICDCS
2012
IEEE
13 years 5 days ago
DARD: Distributed Adaptive Routing for Datacenter Networks
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
Xin Wu, Xiaowei Yang
STOC
2005
ACM
142views Algorithms» more  STOC 2005»
15 years 10 months ago
Market equilibrium via the excess demand function
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
Bruno Codenotti, Benton McCune, Kasturi R. Varadar...