This research states the stylised n (more than two) players' splitting problem as a mathematical programme, relying on definitions of the values of the game and problem stationarity to generate tractable reduced forms, and derives the known solutions according to the properties of pertaining...

This research states the stylised n (more than two) players’ splitting problem as a mathematical programme, relying on definitions of the values of the game and problem stationarity to generate tractable reduced forms, and derives the known solutions according to the properties of pertaining...

This research states the stylised n players’ splitting problem as a mathematical programme, relying on definitions of the values of the game and problem stationarity to generate tractable reduced forms, and derives the known solutions after pertaining first-order conditions. Boundary...

In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying dimension. Conditions are stated under which the algorithm...

Until now most research in dynamic games focus on models with quadratic objective functions because of practical considerations. But in reality, all problems are not quadratic. In this paper, we solve a differential game where players have non-quadratic preferences. In particular we consider an...

In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying dimension. Conditions are stated under which the algorithm...

We analyze the performance of various communication protocols in a generalization of the Crawford-Sobel (1982) model of cheap talk that allows for multiple receivers. We find that whenever the sender can communicate informatively with both receivers by sending private messages, she can...

We analyze the performance of various communication protocols in a generalization of the Crawford-Sobel (1982) model of cheap talk that allows for multiple receivers. We find that whenever the sender can communicate informatively with both receivers by sending private messages, she can...

Sequential search problems such as secretary problems can be extended to a natural zero-sum two-player game where the Decision Maker faces an opponent with a similar move set. This paper analyzes the game for a sequential search problem known as the Cayley-Moser problem, which falls under the...

We consider a general equilibrium model with heterogeneous agents, borrowing constraints, and exogenous labor supply. First, the existence of intertemporal equilibrium is proved even if the aggregate capitals are not uniformly bounded above and the production functions are not time invariant....