In this paper we firstly give an introduction to capital market synergetics, a model enabling us to compute transaction costs and investigate the operating efficiency of a stock market's micro structure. Frankfurt's trading system Xetra and NASDAQ are currently implemented at the computer...

This paper deals with the problem of constructing directed trees of optimal weight and root with depth at most (||) (called – ). We first prove that the maximization and the minimization versions are equal-approximable under the that measures how the value of an approximate solution is placed...

A dual-Eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an Euler circuit in the dual graph. Dual-Eulerian graphs were defined and studied in the context of silicon optimization of cmos layouts. They are...

The determination of local and global positivity (or negativity) of general nonlinear functions plays a fundamental role in several applied mathematical areas. In this work, this subject is addressed by the presentation of a new theorem that allows to determine the sign of a function and...

The paper develops a framework for the analysis of finite -player games, recurrently played by randomly drawn -tuples of players, from a finite population. We first relate the set of equilibria of this game to the set of correlated equilibria of the underlying game, and then focus on learning...

It is usually supposed that tolerance levels are determined by the decision maker in flexible linear programming (FLP) problems. In this paper we shall suppose that the decision maker does not care about the particular values of tolerance levels, but he wishes to keep their sum below a...

One important issue in the theory of Ordered Weighted Averaging (OWA) operators is the determination of the associated weights. One of the first approaches, suggested by O'Hagan, determines a special class of OWA operators having maximal entropy of the OWA weights for a given level of ;...

The concept of discrete convexity for a real-valued function defined on a discrete space is an extension of the convexity definition of continuous functions. The equivalence of discrete convexity to the conventional definition of increasing (non-decreasing) first forward differences of functions...

The possibilities for circuits of length 4 to appear together in a cubic bigraph are classified. That has consequences on the structure of minimally 1-factorable regular bigraphs, i.e. those in which each 1-factor lies in precisely one 1-factorization. We characterize minimally 1-factorable...

Starting from a day-to-day model on hotel specific guest nights we obtain an integer-valued moving average model by cross-sectional and temporal aggregation, The two parameters of the aggregate model reflect mean check-in and the check-out probability. Letting the parameters be functions of...