Displaying 21 – 40 of 63

Showing per page

New light on the theorem of Perron.

Thomas L. Saaty (1985)

Trabajos de Estadística e Investigación Operativa

We prove that the principal eigenvector of a positive matrix represents the relative dominance of its rows or ranking of alternatives in a decision represented by the rows of a pairwise comparison matrix.

New results about impartial solitaire clobber

Eric Duchêne, Sylvain Gravier, Julien Moncel (2009)

RAIRO - Operations Research

Impartial Solitaire Clobber is a one-player version of the combinatorial game Clobber, introduced by Albert et al. in 2002. The initial configuration of Impartial Solitaire Clobber is a graph, such that there is a stone placed on each of its vertex, each stone being black or white. A move of the game consists in picking a stone, and clobbering an adjacent stone of the opposite color. By clobbering we mean that the clobbered stone is removed from the graph, and replaced by the clobbering one....

Newsboy Problem: Viability of Optimal Initial Selling Price and Ordering Policies in the Presence of Exogenous Price Decline and Random Lead Time

Ningombam Sanjib Meitei, Snigdha Banerjee (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Analysis of empirical sales data lead us to consider newsboy model for four practical market conditions arising from the presence/absence of stochastic lead time and exogenous linear temporal decline in selling price when distribution of the stochastic demand depends upon initial selling price. Viability of the solutions is discussed for three strategies of obtaining optimal initial selling price and/or ordering quantity. Numerical studies are conducted to assess the effects of lead time and price...

Non-cooperative game approach to multi-robot planning

Adam Gałuszka, Andrzej Świerniak (2005)

International Journal of Applied Mathematics and Computer Science

A multi-robot environment with a STRIPS representation is considered. Under some assumptions such problems can be modelled as a STRIPS language (for instance, a Block World environment) with one initial state and a disjunction of goal states. If the STRIPS planning problem is invertible, then it is possible to apply the machinery for planning in the presence of incomplete information to solve the inverted problem and then to find a solution to the original problem. In the paper a planning algorithm...

Noncooperative games with noncompact joint strategies sets: increasing best responses and approximation to equilibrium points

Rosa María Flores-Hernández, Raúl Montes-de-Oca (2011)

Kybernetika

In this paper conditions proposed in Flores-Hernández and Montes-de-Oca [3] which permit to obtain monotone minimizers of unbounded optimization problems on Euclidean spaces are adapted in suitable versions to study noncooperative games on Euclidean spaces with noncompact sets of feasible joint strategies in order to obtain increasing optimal best responses for each player. Moreover, in this noncompact framework an algorithm to approximate the equilibrium points for noncooperative games is supplied....

Nonexpansive maps and option pricing theory

Vassili N. Kolokoltsov (1998)

Kybernetika

The famous Black–Sholes (BS) and Cox–Ross–Rubinstein (CRR) formulas are basic results in the modern theory of option pricing in financial mathematics. They are usually deduced by means of stochastic analysis; various generalisations of these formulas were proposed using more sophisticated stochastic models for common stocks pricing evolution. In this paper we develop systematically a deterministic approach to the option pricing that leads to a different type of generalisations of BS and CRR formulas...

Currently displaying 21 – 40 of 63