Nash equilibria with partial monitoring; Computation and Lemke-Howson algorithm
, 2013 In two player bi-matrix games with partial monitoring, actions played are not observed, only some messages are received. Those games satisfy a crucial property of usual bi-matrix games: there are only a finite number of required (mixed) best replies.
openaire +2 more sources
On the finite termination of an entropy function based smoothing Newton method for vertical linear complementarity problems [PDF]
By using a smooth entropy function to approximate the non-smooth max-type function, a vertical linear complementarity problem (VLCP) can be treated as a family of parameterized smooth equations.
Birbil, S.I. +3 more
core +1 more source
A globally convergent simplicial algorithm for stationary point problems on polytopes [PDF]
Stationary ...
Talman, A.J.J., Yamamoto, Y.
core +1 more source
Finding Nash equilibria of bimatrix games [PDF]
, 2006 This thesis concerns the computational problem of finding one Nash equilibrium of a bimatrix game, a two-player game in strategic form. Bimatrix games are among the most basic models in non-cooperative game theory, and finding a Nash equilibrium is ...
Savani, Rahul
core
A new algorithm for generalized fractional programs [PDF]
A new dual problem for convex generalized fractional programs with no duality gap is presented and it is shown how this dual problem can be efficiently solved using a parametric approach. The resulting algorithm can be seen as “dual†to the Dinkelbach-
Barros, A.I. +3 more
core +1 more source
A Constrained Optimization Approach to Solving Convex Equations with Applications to the Linear Complementarity and Brouwer Fixed Point Problems [PDF]
, 1981 This research develops a nonlinear programming approach for solving a convex system of equations. Two applications of interest are also studied, namely, computation of a Brouwer fixed point of a convex function, and the Linear Complementarity Problem ...
Sengupta, Partha
core +1 more source
The development of algorithms in mathematical programming [PDF]
, 1976 This thesis was submitted for the degree of Doctor of Philosophy and was awarded by Brunel University.In this thesis some problems in mathematical programming have been studied.
Jahanshahlou, Gholamreza
core +1 more source
An SLSPP-algorithm to compute an equilibrium in an economy with linear production technologies [PDF]
Topology
Kremers, J.A.W.M., Talman, A.J.J.
core +1 more source
The convex quadratic programming problem [PDF]
, 1989 The purpose of this paper is to investigate the convex quadratic programming problem and its applications. The emphasis is on methods for solving the convex quadratic programming problem.
Williams, James R.
core +1 more source
FIR digital filter design via quadratic programming [PDF]
, 1991 Linear phase FIR digital filter design formulations are discussed. In addition, the design problems are presented in terms of quadratic programming problems, and solved using Lemke's complementary algorithm.
Su, Chien Chung
core +1 more source