Nash equilibrium in tariffs in a multi-country trade model
MetadataShow full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
We study a general equilibrium model of trade with two goods and many countries where each country sets its distortionary tariff noncooperatively to maximize the payoff of the representative household. We prove the existence of pure strategy Nash equilibria by showing that there are consistent bounds on tariff rates that are common across countries and that payoff functions in the induced game are quasiconcave. Separately, we show that best responses are strictly increasing functions, and provide robust examples that show that the game need not be supermodular. The fact that a country’s payoff does not respond monotonically to increases in a competitor’s tariff rate, shows that the standard condition in the literature for payoff comparisons across Nash equilibria fails in our model. We then show that the participation of at most two countries in negotiated tariff changes suffices to induce a Pareto improving allocation relative to a Nash equilibrium. Further results provided concern the location of the best response in relation to the free trade point, the monotonicity of payoffs, and the bounds on equilibrium strategies. The final result is that there is no trade if and only if the equilibrium allocation is Pareto optimal.
Chattopadhyay , S & Mitka , M M 2019 , ' Nash equilibrium in tariffs in a multi-country trade model ' , Journal of Mathematical Economics , vol. 84 , pp. 225-242 . https://doi.org/10.1016/j.jmateco.2019.07.011
Journal of Mathematical Economics
© 2019 Elsevier B.V. All rights reserved. This work has been made available online in accordance with the publisher's policies. This is the author created accepted version manuscript following peer review and as such may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1016/j.jmateco.2019.07.011
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.