Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games

In Pang and Fukushima (Comput Manage Sci 2:21–56, 2005), a sequential penalty approach was presented for a quasi-variational inequality (QVI) with particular application to the generalized Nash game. To test the computational performance of the penalty method, numerical results were reported with an example from a multi-leader-follower game in an electric power market. However, due to an inverted sign in the penalty term in the example and some missing terms in the derivatives of the firms’ Lagrangian functions, the reported numerical results in Pang and Fukushima (Comput Manage Sci 2:21–56, 2005) are incorrect. Since the numerical examples of this kind are scarce in the literature and this particular example may be useful in the future research, we report the corrected results. The online version of the original article can be found under doi:.     

An optimal design of collateralized mortgage obligation with PAC-companion structure using dynamic cash reserve

This paper presents a model for optimally designing a collateralized mortgage obligation (CMO) with a planned amortization class (PAC)-companion structure using dynamic cash reserve. In this structure, the mortgage pool’s cash flow is allocated by rule to the two bond classes such that PAC bondholders receive substantial prepayment protection, that protection being provided by the companion bondholders. The structure we propose provides greater protection to the PAC bondholders than current structures during periods of rising interest rates when this class of bondholders faces greater extension risk. We do so by allowing a portion of the cash flow from the collateral to be reserved to meet the PAC’s scheduled cash flow in subsequent periods. The greater protection is provided by the companion bondholders exposure to interest loss. To tackle this problem, we transform the problem of designing the optimal PAC-companion structure into a standard stochastic linear programming problem which can be solved efficiently. Moreover, we present an extended model by considering the quality of the companion bond and by relaxing the PAC bondholder shortfall constraint. Based on numerical experiments through Monte Carlo simulation, we show the utility of the proposed model.     

Upper and Lower Bounds on Maximum Nonlinearity of n-input m-output Boolean Function

The paper presents lower and upper bounds on the maximumnonlinearity for an n-input m-output Booleanfunction. We show a systematic construction method for a highlynonlinear Boolean function based on binary linear codes whichcontain the first order Reed-Muller code as a subcode. We alsopresent a method to prove the nonexistence of some nonlinearBoolean functions by using nonexistence results on binary linearcodes. Such construction and nonexistence results can be regardedas lower and upper bounds on the maximum nonlinearity. For somen and m, these bounds are tighter than theconventional bounds. The techniques employed here indicate astrong connection between binary linear codes and nonlinear n-input m-output Boolean functions.     

On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm

In this paper we focus on the problem of identifying the index sets P(x):=i|x_i>0, N(x):={i|F_i(x)>0 and C(x):=i|x_i=F_i(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10     

A globally convergent Newton method for solving strongly monotone variational inequalities

Variational inequality problems have been used to formulate and study equilibrium problems, which arise in many fields including economics, operations research and regional sciences. For solving variational inequality problems, various iterative methods such as projection methods and the nonlinear Jacobi method have been developed. These methods are convergent to a solution under certain conditions, but their rates of convergence are typically linear. In this paper we propose to modify the Newton method for variational inequality problems by using a certain differentiable merit function to determine a suitable step length. The purpose of introducing this merit function is to provide some measure of the discrepancy between the solution and the current iterate. It is then shown that, under the strong monotonicity assumption, the method is globally convergent and, under some additional assumptions, the rate of convergence is quadratic. Limited computational experience indicates the high efficiency of the proposed method.     

Variational Inequality Formulation of a Class of Multi-Leader-Follower Games

The multi-leader-follower game can be looked on as a generalization of the Nash equilibrium problem and the Stackelberg game, which contains several leaders and a number of followers. Recently, the multi-leader-follower game has been drawing more and more attention, for example, in electricity power markets. However, when we formulate a general multi-leader-follower game as a single-level game, it will give rise to a lot of problems, such as the lack of convexity and the failure of constraint qualifications. In this paper, to get rid of these difficulties, we focus on a class of multi-leader-follower games that satisfy some particular, but still reasonable assumptions, and show that these games can be formulated as ordinary Nash equilibrium problems, and then as variational inequalities. We establish some results on the existence and uniqueness of a leader-follower Nash equilibrium. We also present illustrative numerical examples from an electricity power market model.     

Restricted generalized Nash equilibria and controlled penalty algorithm

The generalized Nash equilibrium problem (GNEP) is a generalization of the standard Nash equilibrium problem, in which each player’s strategy set may depend on the rival players’ strategies. The GNEP has recently drawn much attention because of its capability of modeling a number of interesting conflict situations in, for example, an electricity market and an international pollution control. However, a GNEP usually has multiple or even infinitely many solutions, and it is not a trivial matter to choose a meaningful solution from those equilibria. The purpose of this paper is two-fold. First we present an incremental penalty method for the broad class of GNEPs and show that it can find a GNE under suitable conditions. Next, we formally define the restricted GNE for the GNEPs with shared constraints and propose a controlled penalty method, which includes the incremental penalty method as a subprocedure, to compute a restricted GNE. Numerical examples are provided to illustrate the proposed approach.     

Molecular rheology of concentrated polymer systems. I

The primitive chain model of Doi and Edwards is generalized to include the short-time relaxation process. Stress relaxation after a sudden imposition of strain is studied in detail. It is shown that in the linear region (small strain) stress relaxation occurs in two steps, the relaxation of chain segments between the fixed entanglement points, and the relaxation of the entanglement points, in accordance with the conventional picture, whereas in the nonlinear region (large strain) there appears a new relaxation process between the above two. The characteristic time of this process is the Rouse relaxation time which the entire chain would have if there were no entanglements, and increases with the square of the molecular weight. This result is consistent with experimental observations.     

Synthesis and reactivity of β-cyclodextrin-histamine as enzyme model

Cyclodextrin (CD) has a hydrophobic cavity which acts like a binding site of an actual enzyme. But enzymatic turnover reaction did not occur in CD-catalyzed reactions. -CD was modified by a histamine group to attach a reactive functional group. -CD-histamine accelerates the hydrolysis of p-nitrophenyl acetate. Catalytic rate constant of this reaction is close to an actual enzyme, -chymotrypsin. Enzymatic turnover reaction is realized with this compound at around neutral pH value.