The inefficiency of Nash and subgame perfect equilibria for network routing

J Correa, J de Jong, B De Keijzer… - … of operations research, 2019 - pubsonline.informs.org
This paper provides new bounds on the quality of equilibria in finite congestion games with
affine cost functions, specifically for atomic network routing games. It is well known that the …

Subgame perfect equilibria under the deferred acceptance algorithm

Y Kawase, K Bando - International Journal of Game Theory, 2021 - Springer
We analyze a subgame perfect equilibrium (SPE) of an extensive game with perfect
information induced by the firm-oriented deferred acceptance (DA) algorithm in a one-to-one …

Subgame perfect equilibria of sequential matching games

Y Kawase, Y Yamaguchi, Y Yokoi - ACM Transactions on Economics …, 2020 - dl.acm.org
We study a decentralized matching market in which firms sequentially make offers to
potential workers. For each offer, the worker can choose “accept” or “reject,” but the decision …