We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.

This work is based on a differential game proposed by Kelvin Lancaster. The game between two agents called workers and capitalists is based on the accumulation and redistribution of benefits among social classes concluding that cooperative outcomes outperform non-cooperative. This approach...

Two approaches to the theory of OCA are distinguished in this paper. The first attempts to define the OCA from the point of view of a single country, and the second examines the optimality of a currency area of a given size anf membership. The present paper after reviewing the drawbacks of the...

In the analysis of equilibrium policies in a dierential game, if agents have different time preference rates, the cooperative (Pareto optimum) solution obtained by applying the Pontryagin's Maximum Principle becomes time inconsistent. In this work we derive a set of dynamic programming equations...

Main objects here are normal-form games, featuring uncertainty and noncooperative players who entertain local visions, form local approximations, and hesitate in making large, swift adjustments. For the purpose of reaching Nash equilibrium, or learning such play, we advocate and illustrate an...

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 we propose a new rule to allocate risk capital to portfolios or divisions within a firm. Specifically, we determine the capital allocation that minimizes the excesses of sets of portfolios in a lexicographical sense. The excess of a set of portfolios is defined as the expected loss...

In this paper we investigate some new applications of Scarf's Lemma. First, we introduce the notion of fractional core for NTU-games, which is always nonempty by the Lemma. Stable allocation is a general solution concept for games where both the players and their possible cooperations can have...

This paper investigates the usefulness of non-cooperative bargaining theory for the analysis of negotiations on water allocation and management. It explores the impacts of different economic incentives, of a stochastic environment and of varying individual preferences on players' strategies and...

The stable roommates problem with payments has as input a graph G(E,V) with an edge weighting w:E_ùR+ and the problem is to find a stable solution. A solution is a matching M with a vector p.RV that satisfies pu+pv=w(uv) for all uv.M and pu=0 for all u unmatched in M. A solution is stable if it...