Sciweavers

35 search results - page 7 / 7
» Computing pure strategy nash equilibria in compact symmetric...
Sort
View
BIRTHDAY
2009
Springer
14 years 4 days ago
Asynchronous Congestion Games
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
ATAL
2007
Springer
13 years 11 months ago
Outperforming the competition in multi-unit sealed bid auctions
In this paper, we examine the behavior of bidding agents that are in direct competition with the other participants in an auction setting. Thus the agents are not simply trying to...
Ioannis A. Vetsikas, Nicholas R. Jennings
ICS
2010
Tsinghua U.
14 years 2 months ago
Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
Maria-Florina Balcan, Avrim Blum, Yishay Mansour
MST
2011
184views Hardware» more  MST 2011»
13 years 9 days ago
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
Tobias Harks
CCS
2009
ACM
14 years 4 days ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...