20 search results - page 2 / 4 » sagt 2009 |
SAGT
2009
Springer
13 years 11 months ago
2009
Springer
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
SAGT
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A mechanism is manipulable if it is in some agents’ best interest to misrepresent their private information. The revelation principle establishes that, roughly, anythin...
SAGT
2009
Springer
13 years 11 months ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
SAGT
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we study a large class of resource allocation problems with an important complication, the utilization cost of a given resource is private information of a profit ma...
SAGT
2009
Springer
13 years 11 months ago
2009
Springer
Congestion games—in which players strategically choose from a set of “resources” and derive utilities that depend on the congestion on each resource— are important in a wid...