We present a distribution-free model of incomplete-information games, both with and without private information, in which the players use a robust optimization approach to contend ...
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
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...
Imitating successful behavior is a natural and frequently applied approach to trust in when facing scenarios for which we have little or no experience upon which we can base our d...
Heiner Ackermann, Petra Berenbrink, Simon Fischer,...
In third generation (3G) wireless data networks, repeated requests for popular data items can exacerbate the already scarce wireless spectrum. In this paper we propose an architec...
Michel X. Goemans, Erran L. Li, Vahab S. Mirrokni,...