Companies that use their own stock to finance acquisitions have incentives to increase their market values prior to the acquisition date. This study examines whether such companies strategically disclose good news or withhold bad news in order to boost their high stock prices. I find that stock swap acquirers are not more likely to issue favorable management forecasts during the period before t...

We prove that a multiple of a log contract prices a variance swap, under arbitrary exponential Lévy dynamics, stochastically time-changed by an arbitrary continuous clock having arbitrary correlation with the driving Lévy process, subject to integrability conditions. We solve for the multiplier, which depends only on the Lévy process, not on the clock. In the case of an arbitrary continuous und...

At the allocation and deallocation of small objects with fixed size, the standard allocator of the runtime system has commonly a worse time performance compared to allocators adapted for a special application field. We propose a memory allocator, originally developed for mesh primitives but also usable for any other small equally sized objects. For a large amount of objects it leads to better r...

For the verification of concurrent programs, it is essential to be able to show that synchronisation mechanisms are implemented correctly. A common way to implement such sychronisers is by using atomic operations. This paper identifies what different synchronisation patterns can be implemented by using atomic read, write and compare-and-set operation. Additionally, this paper proposes also a sp...

In this paper we consider several hardware implementations of the general-purpose atomic primitives fetch and Φ, compare and swap, load linked, and store conditionalon large-scale shared-memory multiprocessors. These primitives have proven popular on small-scale bus-based machines, but have yet to become widely available on large-scale, distributed shared memory machines. We propose several alt...

We prove that a multiple of a log contract prices a variance swap, under arbitrary exponential Lévy dynamics, stochastically time-changed by an arbitrary continuous clock having arbitrary correlation with the driving Lévy process, subject to integrability conditions. We solve for the multiplier, which depends only on the Lévy process, not on the clock. In the case of an arbitrary continuous und...

In this paper, we focus on introducing the Variance Swap and estimating the portfolios. The portfolios of the Variance Swap are optimized based on maximizing the distorted expectation given the index of acceptability. The variance strike is calculated from the option surface calibration. The realized variance is constructed through Hardy-Littlewood transform considering the highly correlated au...

We study specific nonlinear transformations of the Black-Scholes implied volatility to show remarkable properties of the volatility surface. Model-free bounds on the implied volatility skew are given. Pricing formulas for the European options which are written in terms of the implied volatility are given. In particular, we prove elegant formulas for the fair strikes of the variance swap and the...

Work on non-blocking data structures has proposed extending processor designs with a compare-and-swap primitive, CAS2, which acts on two arbitrary memory locations. Experience suggested that current operations, typically single-word compare-and-swap (CAS1), are not expressive enough to be used alone in an eÆcient manner. In this paper we build CAS2 from CAS1 and, in fact, build an arbitrary mul...

Shared objects are the means by which processes gather and exchange information about the state of a distributed system. Objects that disclose more information about the system—and thus provide a more centralized view—are therefore more desirable. In this paper, we propose the schedule reconstruction (SR) problem as a new metric for the disclosure power of shared memory objects. In schedule rec...