On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games

@inproceedings{Drees2015OnEA,
  title={On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games},
  author={Maximilian Drees and Matthias Feldotto and S{\"o}ren Riechers and Alexander Skopalik},
  booktitle={SAGT},
  year={2015}
}
In bandwidth allocation games (BAGs), the strategy of a player consists of various demands on different resources. The player’s utility is at most the sum of these demands, provided they are fully satisfied. Every resource has a limited capacity and if it is exceeded by the total demand, it has to be split between the players. Since these games generally do… CONTINUE READING