Chapter

Internet and Network Economics

Volume 4858 of the series Lecture Notes in Computer Science pp 30-41

A Unified Approach to Congestion Games and Two-Sided Markets

  • Heiner AckermannAffiliated withDepartment of Computer Science, RWTH Aachen
  • , Paul W. GoldbergAffiliated withDepartment of Computer Science, University of Liverpool
  • , Vahab S. MirrokniAffiliated withMicrosoft Research, Redmond, WA
  • , Heiko RöglinAffiliated withDepartment of Computer Science, RWTH Aachen
  • , Berthold VöckingAffiliated withDepartment of Computer Science, RWTH Aachen

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Congestion games are a well-studied model for resource sharing among uncoordinated selfish agents. Usually, one assumes that the resources in a congestion game do not have any preferences over the players that can allocate them. In typical load balancing applications, however, different jobs can have different priorities, and jobs with higher priorities get, for example, larger shares of the processor time. We introduce a model in which each resource can assign priorities to the players and players with higher priorities can displace players with lower priorities. Our model does not only extend standard congestion games, but it can also be seen as a model of two-sided markets with ties. We prove that singleton congestion games with priorities are potential games, and we show that every player-specific singleton congestion game with priorities possesses a pure Nash equilibrium that can be found in polynomial time. Finally, we extend our results to matroid congestion games, in which the strategy space of each player consists of the bases of a matroid over the resources.