Collusive game solutions via optimization

Authors:
J. E. Harrington;B. F. Hobbs;J. S. Pang;A. Liu;G. Roch
Affiliations:
Department of Economics, The Johns Hopkins University, 21218-2682, Maryland, Baltimore, USA;Department of Geography and Environmental Engineering, The Johns Hopkins University, 21218-2682, Maryland, Baltimore, USA;Department of Mathematical Sciences, Rensselaer Polytechnic Institute, 12180-3590, New York, Troy, USA;Department of Applied Mathematics and Statistics, The Johns Hopkins University, 21218-2682, Maryland, Baltimore, USA;Department of Applied Mathematics and Statistics, The Johns Hopkins University, 21218-2682, Maryland, Baltimore, USA
Venue:
Mathematical Programming: Series A and B
Year:
2005

Citing 0
Cited 4

Optimization and dynamical systems algorithms for finding equilibria of stochastic games

Optimization Methods & Software
Modeling Implicit Collusion Using Coevolution

Operations Research
Error bound results for generalized D-gap functions of nonsmooth variational inequality problems

Journal of Computational and Applied Mathematics
A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Nash-based collusive game among a finite set of players is one in which the players coordinate in order for each to gain higher payoffs than those prescribed by the Nash equilibrium solution. In this paper, we study the optimization problem of such a collusive game in which the players collectively maximize the Nash bargaining objective subject to a set of incentive compatibility constraints. We present a smooth reformulation of this optimization problem in terms of a nonlinear complementarity problem. We establish the convexity of the optimization problem in the case where each player's strategy set is unidimensional. In the multivariate case, we propose upper and lower bounding procedures for the collusive optimization problem and establish convergence properties of these procedures. Computational results with these procedures for solving some test problems are reported.