To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This paper investigates spatial data on the unit sphere. Traditionally, isotropic Gaussian random fields are considered as the underlying mathematical model of the cosmic microwave background (CMB) data. We discuss the generalized multifractional Brownian motion and its pointwise Hölder exponent on the sphere. The multifractional approach is used to investigate the CMB data from the Planck mission. These data consist of CMB radiation measurements at narrow angles of the sky sphere. The results obtained suggest that the estimated Hölder exponents for different CMB regions do change from location to location. Therefore, the CMB temperature intensities are multifractional. The methodology developed is used to suggest two approaches for detecting regions with anomalies in the cleaned CMB maps.
We discuss a bi-objective two-stage assignment problem (BiTSAP) that aims at minimizing two objective functions: one comprising a nonlinear cost function defined explicitly in terms of assignment variables and the other a total completion time. A two-stage assignment problem deals with the optimal allocation of n jobs to n agents in two stages, where $n_1$ out of n jobs are primary jobs which constitute Stage-1 and the rest of the jobs are secondary jobs constituting Stage-2. The paper proposes an algorithm that seeks an optimal solution for a BiTSAP in terms of various efficient time-cost pairs. An algorithm for ranking all feasible assignments of a two-stage assignment problem in order of increasing total completion time is also presented. Theoretical justification and numerical illustrations are included to support the proposed algorithms.
We consider fully three-dimensional time-dependent outflow from a source into a surrounding fluid of different density. The source is distributed over a sphere of finite radius. The nonlinear problem is formulated using a spectral approach in which two streamfunctions and the density are represented as a Fourier-type series with time-dependent coefficients that must be calculated. Linearized theories are also discussed and an approximate stability condition for early stages in the outflow is derived. Nonlinear solutions are presented and different outflow shapes adopted by the fluid interface are investigated.
We explain some key challenges when dealing with a single- or multi-objective optimization problem in practice. To overcome these challenges, we present a mathematical program that optimizes the Nash social welfare function. We refer to this mathematical program as the Nash social welfare program (NSWP). An interesting property of the NSWP is that it can be constructed for any single- or multi-objective optimization problem. We show that solving the NSWP could result in more desirable solutions in practice than its single- or multi-objective counterpart. We also discuss several promising approaches that could be employed to solve the NSWP in practice.
This paper looks at adapting the method of Medvedev and Scaillet for pricing short-term American options to evaluate short-term convertible bonds. However unlike their method, we provide explicit formulae for the coefficients of our series solution. This means that we do not need to solve complicated recursive systems, and can efficiently provide fast solutions. We also compare the method with numerical solutions, and find that it performs extremely well, giving accurate bond prices as well as accurate optimal conversion prices.
In this chapter, we present linear complementarity problems, and use them to provide sufficient conditions that guarantee the existence of an undiscounted $\ep$-equilibrium in quitting games.
In this chapter, we present a technique to study uniform equilibria in stochastic games, called the \emph{vanishing discount factorapproach}.
This approach was developed to prove the existence of a uniform $\ep$-equilibrium in two-player nonzero-sum absorbing games using a function $\lambda \mapsto_\lambda$, which assigns a stationary $\lambda$-discounted equilibrium $x_\lambda$ to every\lambda \in (0,1]$, and analyzing the asymptotic properties of this function as $\lambda$ goes to 0.
We will use this approach to show that every absorbing game in which the probability of absorption is positive whatever the players play has a stationary uniform 0-equilibrium,and that every two-player absorbing game has a uniform $\ep$-equilibrium, which need not be stationary, for every $\ep > 0$.
To prove the second result, we will show how statistical tests are used in the construction of uniform $\ep$-equilibria.
In this chapter, we review material on strategic-form games thatwill be needed in the sequel. Readers who are interested in expanding their knowledge of strategic-form games are referred to Maschler, Solan, and Zamir (2013, Chapters 4 and 5).
In Section~\ref{continuity} we proved that the discounted value is continuous in the parameters of the game, see Theorem~\ref{theorem7}.
One weakness of this result is that it does not bound the Lipschitz constant of the value function $(\lambda,q,r) \mapsto v_\lambda(s;q,r)$.
In this chapter, we will strengthen Theorem~\ref{theorem7}, and, using the concept of $B$-graphs, develop a bound on the Lipschitz constant of the value function.
Our technique will allow us to study the continuityof the limit $\lim_{\lambda \to 0} v_\lambda(s;q,r)$ as a function of $q$ and $r$.
In this chapter, we prove a Tauberian Theorem regarding the relation between the Abel limit and the Ces`aro limit of a sequence of real numbers, and apply it to prove that a uniformly $\ep$-optimal strategy exists in Hidden Markov decision problems.
In this chapter, we prove Ramsey's Theorem, which states that for every coloring of the complete infinite graph by finitely many colors there is an infinite complete onochromatic subgraph.
We then define the notion of undiscounted $\ep$-equilibrium, and show that every two-player deterministic stopping game admits an undiscounted $\ep$-equilibrium.
In this chapter we define semi-algebraic sets and study their basic properties. We then apply our findings to prove that for every initial state s the limit $\lim_{\lambda \to 0} v_\lambda(s)$ exists.