Can noncooperative behaviour of merchants lead to a market allocation that prima facie seems anticompetitive? We introduce a model in which service providers aim at optimizing the number of customers who use their services, while customers aim at choosing service providers with minimal customer load. Each service provider chooses between a variety of levels of service, and as long as it does not lose customers, aims at minimizing its level of service; the minimum level of service required to satisfy a customer varies across customers. We consider a two-stage competition, in the first stage of which the service providers select their levels of service, and in the second stage --- customers choose between the service providers. (We show via a novel construction that for any choice of strategies for the service providers, a unique distribution of the customers' mass between them emerges from all Nash equilibria among the customers, showing the incentives of service providers in the two-stage game to be well defined.) In the two-stage game, we show that the competition among the service providers possesses a unique Nash equilibrium, which is moreover super strong; we also show that all sequential better-response dynamics of service providers reach this equilibrium, with best-response dynamics doing so surprisingly fast. If service providers choose their levels of service according to this equilibrium, then the unique Nash equilibrium among customers in the second phase is essentially an allocation (i.e. split) of the market between the service providers, based on the customers' minimum acceptable quality of service; moreover, each service provider's chosen level of service is the lowest acceptable by the entirety of the market share allocated to it. Our results show that this seemingly-cooperative allocation of the market arises as the unique and highly-robust outcome of noncooperative (i.e. free from any form of collusion), even myopic, service-provider behaviour. The results of this paper are applicable to a variety of scenarios, such as the competition among ISPs, and shed a surprising light on aspects of location theory, such as the formation and structure of a city's central business district.
[1]
H. Hotelling.
Stability in Competition
,
1929
.
[2]
L. Shapley,et al.
Potential Games
,
1994
.
[3]
Itai Ashlagi,et al.
Equilibria of Online Scheduling Algorithms
,
2013,
AAAI.
[4]
Itai Ashlagi,et al.
Competing Schedulers
,
2010,
AAAI.
[5]
R. Holzman,et al.
Strong Equilibrium in Congestion Games
,
1997
.
[6]
Philip Wolfe,et al.
Contributions to the theory of games
,
1953
.
[7]
R. Varga,et al.
Proof of Theorem 4
,
1983
.
[8]
Moshe Tennenholtz,et al.
Strong and Correlated Strong Equilibria in Monotone Congestion Games
,
2006,
WINE.
[9]
Tim Roughgarden,et al.
How bad is selfish routing?
,
2002,
JACM.
[10]
Marek Mikolaj Kaminski,et al.
'Hydraulic' rationing
,
2000,
Math. Soc. Sci..
[11]
Ron Holzman,et al.
Network structure and strong equilibrium in route selection games
,
2003,
Math. Soc. Sci..
[12]
R. McAfee.
Mechanism Design by Competing Sellers
,
1993
.
[13]
D. Schmeidler.
Equilibrium points of nonatomic games
,
1973
.
[14]
Robert J. Aumann,et al.
16. Acceptable Points in General Cooperative n-Person Games
,
1959
.
[15]
Igal Milchtaich,et al.
Generic Uniqueness of Equilibrium in Large Crowding Games
,
2000,
Math. Oper. Res..
[16]
Richard S. Varga,et al.
Proof of Theorem 5
,
1983
.
[17]
N. Meyers,et al.
H = W.
,
1964,
Proceedings of the National Academy of Sciences of the United States of America.
[18]
R. Rosenthal.
A class of games possessing pure-strategy Nash equilibria
,
1973
.