Sciweavers

224 search results - page 42 / 45
» On Nash-Equilibria of Approximation-Stable Games
Sort
View
ATAL
2007
Springer
14 years 1 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
CDC
2009
IEEE
118views Control Systems» more  CDC 2009»
14 years 6 days ago
Nash equilibrium problems with congestion costs and shared constraints
Abstract— Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant ...
Huibing Yin, Uday V. Shanbhag, Prashant G. Mehta
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
14 years 2 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang
MFCS
2007
Springer
14 years 1 months ago
Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
Spyros C. Kontogiannis, Paul G. Spirakis
WINE
2009
Springer
171views Economy» more  WINE 2009»
14 years 2 months ago
The Impact of Social Ignorance on Weighted Congestion Games
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kap...