This paper has developed a solution algorithm for linear rational expectation models under imperfect information. Imperfect information in this paper means that some decision makings are based on smaller information sets than others. The algorithm generates the solution in the form of k_t+1 =...

Wir definieren die Arbeitsproduktivität als Ergebnis der arbeitsplatzspezifischen Höhe und Übereinstimmung von Anforderungen des Arbeitsplatzes und Eigenschaften/Kompetenzen des Bewerbers und verwenden den Gale-Shapley Algorithmus als dezentrale doppelte Auktion zur Zuordnung von...

We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that...

In this paper we study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice Zn of the n-dimensional Euclidean space IRn. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in...

We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that...

Algorithms have found their way into courtrooms, college admission committees, and human resource departments. While defendants and other disappointed parties have challenged the use of algorithms on the basis of due process or similar objections, it should be expected that they will also...