We employ some of the modern tools of economic theory and time series econometrics to consider a number of economic problems. The communication and coordination problems we study are relevant in accounting, business, economics and finance. The thesis begins by examining the behaviour of people and organisations, who are supposed to share a common goal. Then it considers the equilibriating mechanisms of behaviour by groups of economic agents, who usually have conflicting interests. We apply the tools of non-cooperative game theory, which constitutes a large part of modern economic theory. In the sequel, we address the question of why people behave the way they do in their economic a↵airs. Peoples' economic behaviour is mirrored in the aggregates of macroeconomics. We propose a Time Varying Autoregressive model to study the movements in the five main macroeconomic variables. The methods come from standard Time Series Analysis, but we do introduce some innovative time series techniques. Finally, we conduct an empirical investigation of the movements in one of the five main macroeconomic variables, the rate of inflation. Among the econometric tools employed are standard Autoregressive models (AR), Autoregressive Distributed Lag models (ADL) and the more recent Generalised Autoregressive Conditional Heteroskedasticity (GARCH) methodology.

We begin by recalling the notion of a coarse space as defined by John Roe. We show that metrizability of coarse spaces is a coarse invariant. The concepts of bounded geometry, asymptotic dimension, and Guoliang Yu's Property A are investigated in the setting of coarse spaces. In particular, we show that bounded geometry is a coarse invariant, and we give a proof that finite asymptotic dimension implies Property A in this general setting. The notion of a metric approximation is introduced, and a characterization theorem is proved regarding bounded geometry. Chapter 7 presents a discussion of coarse structures on the minimal uncountable ordinal. We show that it is a nonmetrizable coarse space not of bounded geometry. Moreover, we show that this space has asymptotic dimension 0; hence, it has Property A.Finally, Chapter 8 regards coarse structures on products of coarse spaces. All of the previous concepts above are considered with regard to 3 different coarse structures analogous to the 3 different topologies on products in topology. In particular, we see that an arbitrary product of spaces with any of the 3 coarse structures with asymptotic dimension 0 has asymptotic dimension 0.

In this paper we establish the existence and partial regularity of a (d-2)-dimensional edge-length minimizing polyhedron in [Special characters omitted.] . The minimizer is a generalized convex polytope of volume one which is the limit of a minimizing sequence of polytopes converging in the Hausdorff metric. We show that the (d-2)-dimensional edge-length ζ d -2 is lower-semicontinuous under this sequential convergence. Here the edge set of the limit generalized polytope is a closed subset of the boundary whose complement in the boundary consists of countably many relatively open planar regions.

No description available.

This article considers three standard asset pricing models with adaptive agents and stochastic non-stationary dividends. We assume that the parameters are estimated by exponential smoothing, such that prices and returns remain random variables. This paper provides sufficient conditions for the ergodicity of the return process and checks whether the perceived law assumed by the bounded rational agents can be considered to be sound with the returns observed. (author's abstract) / Series: Report Series SFB "Adaptive Information Systems and Modelling in Economics and Management Science"

Let $l^2(Bbb Z)$ be the Hilbert space of square summable double sequences of complex numbers with standard basis ${e_n:ninBbb Z}$, and let us consider a bounded matrix $A$ on $l^2(Bbb Z)$ satisfying the following system of equations egin{itemize} item[1.] $lan Ae_{2j},e_{2i} an=p_{ij}+alan Ae_{j},e_i an$; item[2.] $lan Ae_{2j},e_{2i-1} an=q_{ij}+blan Ae_{j},e_{i} an$; item[3.] $lan Ae_{2j-1},e_{2i} an=v_{ij}+clan Ae_{j},e_{i} an$; item[4.] $lan Ae_{2j-1},e_{2i-1} an=w_{ij}+dlan Ae_{j},e_{i} an$ end{itemize} for all $i,j$, where $P=(p_{ij})$, $Q=(q_{ij})$, $V=(v_{ij})$, $W=(w_{ij})$ are bounded matrices on $l^2(Bbb Z)$ and $a,b,c,dinBbb C$. par It is clear that the solutions of the above system of equations introduces a class of infinite matrices whose entries are related ``dyadically". In cite{Ho:g}, it is shown that the seemingly complicated task of constructing these matrices can be carried out alternatively in a systematical and relatively simple way by applying the theory of Hardy classes of operators through certain operator equation on ${cal B}({cal H})$ (space of bounded operators on $cal H$) induced by a shift. Our purpose here is to present explicit formula for the homogeneous solutions this equation.

This dissertation explores the necessary and sufficient conditions to solve a variant of the dining philosophers problem. This dining variant is defined by three properties: wait-freedom, eventual weak exclusion, and eventual bounded fairness. Wait-freedom guarantees that every correct hungry process eventually enters its critical section, regardless of process crashes. Eventual weak exclusion guarantees that every execution has an infinite suffix during which no two live neighbors execute overlapping critical sections. Eventual bounded fairness guarantees that there exists a fairness bound k such that every execution has an infinite suffix during which no correct hungry process is overtaken more than k times by any neighbor. This dining variant (WF-EBF dining for short) is important for synchronization tasks where eventual safety (i.e., eventual weak exclusion) is sufficient for correctness (e.g., duty-cycle scheduling, self-stabilizing daemons, and contention managers). Unfortunately, it is known that wait-free dining is unsolvable in asynchronous message-passing systems subject to crash faults. To circumvent this impossibility result, it is necessary to assume the existence of bounds on timing properties, such as relative process speeds and message delivery time. As such, it is of interest to characterize the necessary and sufficient timing assumptions to solve WF-EBF dining. We focus on implicit timing assumptions, which can be encapsulated by failure detectors. Failure detectors can be viewed as distributed oracles that can be queried for potentially unreliable information about crash faults. The weakest detector D for WF-EBF dining means that D is both necessary and sufficient. Necessity means that every failure detector that solves WF-EBF dining is at least as strong as D. Sufficiency means that there exists at least one algorithm that solves WF-EBF dining using D. As such, our research goal is to characterize the weakest failure detector to solve WF-EBF dining. We prove that the eventually perfect failure detector 3P is the weakest failure detector for solving WF-EBF dining. 3P eventually suspects crashed processes permanently, but may make mistakes by wrongfully suspecting correct processes finitely many times during any execution. As such, 3P eventually stops suspecting correct processes.

No description available.

<p>Distributed real-time database systems demand consistency and timeliness. One approach for this problem is eventual consistency which guarantees local consistency within predictable time. Global consistency can be reached by best effort mechanisms but for some scenarios, e.g. an alarm signal, this may not be suffcient. Bounded delay replication, which provides global consistency in bounded time, ensures that after the local commit of a transaction updates are propagated to and integrated at any remote node within bounded time. The DRTS group at the University of Skövde is working on a project called DeeDS, which is a distributed real-time database prototype. In this prototype, eventual consistency with as</p><p>soon as possible (ASAP) replication is implemented. The goal of this dissertation is to further develop replication in this prototype in coexistence to the existing eventual consistency which implies the extension of both the theory and the implementation.</p><p>The main issue with bounded time replication is to make all parts, which are involved in the replication process predictable and simultaneously support eventual consistency with as soon as possible replication.</p>

Zugl.: Bremen, Univ., Diss., 2009