Whose land was it anyway? The Crichel Down Rules and the sale of public land

The guiding principle of compulsory purchase of interests in land in England and Wales is that of fairness, best stated in the words of Lord Justice Scott in Horn v Sunderland Corporation when he said that the owner has “the right to be put, so far as money can do it, in the same position as if his land had not been taken from him”. In many instances, land acquired by compulsion subsequently becomes surplus to the requirements of the acquiring authority. This may be because the intended development scheme was scrapped, or substantially modified, or that after the passage of time the use of the land for which the purchase took place is no longer required. More controversially it may be that for ‘operational reasons’ the acquiring authority knowingly purchased more land than was required for the scheme. Under these circumstances, the Crichel Down Rules (‘the Rules’) require government departments and other statutory bodies to offer back to the former owners or their successors, any land previously so acquired by, or under the threat of, compulsory purchase.

The Clean Development Mechanism as ethical development? Reconciling emissions trading and local development

This paper examines the ethics of the Clean Development Mechanism (CDM) in its architecture, processes and outcomes and its potential to allocate resources to the poor as ‘ethical development’. Two specific examples of CDM projects help us to explore some of the quandaries that seem to be quickly defining operating procedure for the CDM in its efforts to bring entitlementsto the poor. The paper concludes with reflections on the normative and social complications of the CDM and closes with three key areas of further investigation.

Permanent trading impacts and bond yields

We analyze four years of transaction data for euro-area sovereign bonds traded on the MTS electronic platforms. In order to measure the informational content of trading activity, we estimate the permanent price response to trades. We find not only strong evidence of information asymmetry in sovereign bond markets, but we also show the relevance of information asymmetry in explaining the cross-sectional variations of bond yields across a wide range of bond maturities and countries. Our results confirm that trades of more recently issued bonds and longer maturity bonds have a greater permanent effect on prices. We compare the price impact of trades for bonds across different maturity categories and find that trades of French and German bonds have the highest long-term price impact in the short maturity class whereas trades of German bonds have the highest permanent price impacts in the long maturity class. More importantly, we study the cross-section of bond yields and find that after controlling for conventional factors, investors demand higher yields for bonds with larger permanent trading impact. Interestingly, when investors face increased market uncertainty, they require even higher compensation for information asymmetry.

Real options and game theoretical approaches to real estate development projects: multiple equilibria and the implications of different tie-breaking rules

This paper contributes to a fast growing literature which introduces game theory in the analysis of real option investments in a competitive setting. Specifically, in this paper we focus on the issue of multiple equilibria and on the implications that different equilibrium selections may have for the pricing of real options and for subsequent strategic decisions. We present some theoretical results of the necessary conditions to have multiple equilibria and we show under which conditions different tie-breaking rules result in different economic decisions. We then present a numerical exercise using the in formation set obtained on a real estate development in South London. We find that risk aversion reduces option value and this reduction decreases marginally as negative externalities decrease.

New rôles and development rules for housing associations: rhe rise of design and build?

This paper summarises an initial report carried out by the Housing Business Research Group, of the University of Reading into Design and Build procurement and a number of research projects undertaken by the national federation of Housing Associations (NFHA), into their members' development programmes. The paper collates existing statistics from these sources and examines the way in which Design and Build procurement can be adapted for the provision of social housing. The paper comments on these changes and questions how risk averting the adopted strategies are in relation to long term housing business management issues arising from the quality of the product produced by the new system.

Real estate mutual funds: herding, momentum-trading and performance

This study jointly examines herding, momentum trading and performance in real estate mutual funds (REMFs). We do this using trading and performance data for 159 REMFs across the period 1998–2008. In support of the view that Real Estate Investment Trust (REIT) stocks are relatively more transparent, we find that stock herding by REMFs is lower in REIT stocks than other stock. Herding behavior in our data reveals a tendency for managers to sell winners, reflective of the “disposition effect.” We find low overall levels of REMF momentum trading, but further evidence of the disposition effect when momentum trading is segregated into buy–sell dimensions. We test the robustness of our analysis using style analysis, and by reference to the level of fund dividend distribution. Our results for this are consistent with our conjecture about the role of transparency in herding, but they provide no new insights in relation to the momentum-trading dimensions of our analysis. Summarizing what are complex interrelationships, we find that neither herding nor momentum trading are demonstrably superior investment strategies for REMFs.

Parallel induction of modular classification rules

The Distributed Rule Induction (DRI) project at the University of Portsmouth is concerned with distributed data mining algorithms for automatically generating rules of all kinds. In this paper we present a system architecture and its implementation for inducing modular classification rules in parallel in a local area network using a distributed blackboard system. We present initial results of a prototype implementation based on the Prism algorithm.

J-PMCRI: a methodology for inducing pre-pruned modular classification rules

Inducing rules from very large datasets is one of the most challenging areas in data mining. Several approaches exist to scaling up classification rule induction to large datasets, namely data reduction and the parallelisation of classification rule induction algorithms. In the area of parallelisation of classification rule induction algorithms most of the work has been concentrated on the Top Down Induction of Decision Trees (TDIDT), also known as the ‘divide and conquer’ approach. However powerful alternative algorithms exist that induce modular rules. Most of these alternative algorithms follow the ‘separate and conquer’ approach of inducing rules, but very little work has been done to make the ‘separate and conquer’ approach scale better on large training data. This paper examines the potential of the recently developed blackboard based J-PMCRI methodology for parallelising modular classification rule induction algorithms that follow the ‘separate and conquer’ approach. A concrete implementation of the methodology is evaluated empirically on very large datasets.

Induction of modular classification rules: using Jmax-pruning

The Prism family of algorithms induces modular classification rules which, in contrast to decision tree induction algorithms, do not necessarily fit together into a decision tree structure. Classifiers induced by Prism algorithms achieve a comparable accuracy compared with decision trees and in some cases even outperform decision trees. Both kinds of algorithms tend to overfit on large and noisy datasets and this has led to the development of pruning methods. Pruning methods use various metrics to truncate decision trees or to eliminate whole rules or single rule terms from a Prism rule set. For decision trees many pre-pruning and postpruning methods exist, however for Prism algorithms only one pre-pruning method has been developed, J-pruning. Recent work with Prism algorithms examined J-pruning in the context of very large datasets and found that the current method does not use its full potential. This paper revisits the J-pruning method for the Prism family of algorithms and develops a new pruning method Jmax-pruning, discusses it in theoretical terms and evaluates it empirically.