Sciweavers

SIGECOM
2006
ACM
107views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Networks preserving evolutionary equilibria and the power of randomization
We study a natural extension of classical evolutionary game theory to a setting in which pairwise interactions are restricted to the edges of an undirected graph or network. We ge...
Michael S. Kearns, Siddharth Suri
SIGECOM
2006
ACM
128views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Controlling a supply chain agent using value-based decomposition
We present and evaluate the design of Deep Maize, our entry in the 2005 Trading Agent Competition Supply Chain Management scenario. The central idea is to decompose the problem by...
Christopher Kiekintveld, Jason Miller, Patrick R. ...
SIGECOM
2006
ACM
115views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Multi-attribute coalitional games
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attribute...
Samuel Ieong, Yoav Shoham
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2006
ACM
96views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Non-cooperative multicast and facility location games
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,...
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
SIGECOM
2006
ACM
88views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Implementation with a bounded action space
While traditional mechanism design typically assumes isomorphism between the agents’ type- and action spaces, in many situations the agents face strict restrictions on their act...
Liad Blumrosen, Michal Feldman
SIGECOM
2006
ACM
81views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Welfare maximization in congestion games
Liad Blumrosen, Shahar Dobzinski
SIGECOM
2006
ACM
82views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Incentive-compatible interdomain routing
Joan Feigenbaum, Vijay Ramachandran, Michael Schap...