Sciweavers

19 search results - page 1 / 4
» Miscomputing ratio: social cost of selfish computing
Sort
View
ATAL
2003
Springer
13 years 10 months ago
Miscomputing ratio: social cost of selfish computing
Auctions are useful mechanism for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders’ valuations for ite...
Kate Larson, Tuomas Sandholm
NETWORKING
2008
13 years 6 months ago
On the Social Cost of Distributed Selfish Content Replication
We study distributed content replication networks formed voluntarily by selfish autonomous users, seeking access to information objects that originate from distant servers. Each us...
Gerasimos G. Pollatos, Orestis Telelis, Vassilis Z...
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
13 years 6 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
CAAN
2004
Springer
13 years 8 months ago
The Efficiency of Optimal Taxes
It is well known that the selfish behavior of users in a network can be regulated through the imposition of the so-called optimal taxes on the network edges. Any traffic equilibriu...
George Karakostas, Stavros G. Kolliopoulos
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
13 years 8 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza