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...
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...
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...
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...
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