This paper studies liquidity and volatility commonality in the Canadian stock market. We show that five various liquidity measures display strong evidence of commonality at both market-wide and industry specific levels. Our findings extend the results of previous studies in liquidity commonality, and show that even after controlling for individual determinants of liquidity such as price, volume...

c © 2006 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...

Consider the feasibility problem in higher-dimensional orthogonal packing. Given a set I of d-dimensional rectangles, we need to decide whether a feasible packing in a d-dimensional rectangular container is possible. No item rotation is allowed and item edges are parallel to the coordinate axes. Typically, solution methods employ some bounds to facilitate the decision. Various bounds are known,...

This paper presents an approach for solving a new real problem in Cutting and Packing. At its core is an innovative mixed integer programme model that places irregular pieces and defines guillotine cuts. The two-dimensional irregular shape bin packing problem with guillotine constraints arises in the glass cutting industry, for example, the cutting of glass for conservatories. Almost all cuttin...

For decades researchers have struggled with the problem of envy-free cake cutting: how to divide a divisible good between multiple agents so that each agent likes his own allocation best. Although an envy-free cake cutting protocol was ultimately devised, it is unbounded, in the sense that the number of operations can be arbitrarily large, depending on the preferences of the agents. We ask whet...

I) Given a segment-cuttable polygon P drawn on a planar piece of material Q, we show how to cut P out of Q by a (short) segment saw with a total length of the cuts no more than 2.5 times the optimal. We revise the algorithm of Demaine et al. (2001) so as to achieve this ratio. (II) We prove that any collection R of n disjoint1 axis-parallel rectangles drawn on a planar piece of material Q is cu...

This paper proposes a cake-cutting protocol using cryptography when the cake is a heterogeneous good that is represented by an interval on a real line. Although the Dubins-Spanier moving-knife protocol with one knife achieves simple fairness, all players must execute the protocol synchronously. Thus, the protocol cannot be executed on asynchronous networks such as the Internet. We show that the...