We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects userdefined bounds on the number of returned hits. We assume a real-world...
It is a challenging problem to find agents’ rational strategies in bargaining with incomplete information. In this paper we perform a game theoretic analysis of agents’ ratio...
We model the relationship between a WLAN access point (AP) and a paying mobile station (MS) as a waiting-line auction [1] in which clients bids for transmission using the length o...
We study the relationship between the social cost of correlated equilibria and the social cost of Nash equilibria. In contrast to previous work focusing on the possible benefits ...
Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson...