Sciweavers

29 search results - page 3 / 6
» sigecom 2006
Sort
View
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
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
125views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Minimum payments that reward honest reputation feedback
Online reputation mechanisms need honest feedback to function effectively. Self interested agents report the truth only when explicit rewards offset the cost of reporting and th...
Radu Jurca, Boi Faltings
SIGECOM
2006
ACM
155views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Incentives engineering for structured P2P systems - a feasibility demonstration using economic experiments
Structured peer-to-peer systems allow to administer large volumes of data. Several peers collaborate to generate a query result. Analyses of unstructured peer-to-peer systems, nam...
Stephan Schosser, Klemens Böhm, Rainer Schmid...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden