Sciweavers

SAGT
2009
Springer
177views Game Theory» more  SAGT 2009»
13 years 11 months ago
Characterizing Incentive Compatibility for Convex Valuations
We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
André Berger, Rudolf Müller, Seyed Hos...
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
13 years 11 months ago
On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design
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...
José R. Correa, Nicolas Figueroa
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
13 years 11 months ago
Learning and Approximating the Optimal Strategy to Commit To
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...
Joshua Letchford, Vincent Conitzer, Kamesh Munagal...
SAGT
2009
Springer
297views Game Theory» more  SAGT 2009»
13 years 11 months ago
Characterizing the Existence of Potential Functions in Weighted Congestion Games
Tobias Harks, Max Klimm, Rolf H. Möhring
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
13 years 11 months ago
Doing Good with Spam Is Hard
We study economic means to improve network performance in the well-known game theoretic traffic model due to Wardrop. We introduce two sorts of spam flow - auxiliary and adversari...
Martin Hoefer, Lars Olbrich, Alexander Skopalik
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
13 years 11 months ago
Anarchy, Stability, and Utopia: Creating Better Matchings
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad
SAGT
2009
Springer
113views Game Theory» more  SAGT 2009»
13 years 11 months ago
Games with Congestion-Averse Utilities
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...
Andrew Byde, Maria Polukarov, Nicholas R. Jennings
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
13 years 11 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
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...
Ronald Koch, Martin Skutella
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
13 years 11 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
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
13 years 11 months ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu