Spatial optimization for land use allocation: accounting for sustainability concerns

Land-use allocation has long been an important area of research in regional science. Land-use patterns are fundamental to the functions of the biosphere, creating interactions that have substantial impacts on the environment. The spatial arrangement of land uses therefore has implications for activity and travel within a region. Balancing development, economic growth, social interaction, and the protection of the natural environment is at the heart of long-term sustainability. Since land-use patterns are spatially explicit in nature, planning and management necessarily must integrate geographical information system and spatial optimization in meaningful ways if efficiency goals and objectives are to be achieved. This article reviews spatial optimization approaches that have been relied upon to support land-use planning. Characteristics of sustainable land use, particularly compactness, contiguity, and compatibility, are discussed and how spatial optimization techniques have addressed these characteristics are detailed. In particular, objectives and constraints in spatial optimization approaches are examined

Stochastic Combinatorial Optimization via Poisson Approximation

We study several stochastic combinatorial problems, including the expected utility maximization problem, the stochastic knapsack problem and the stochastic bin packing problem. A common technical challenge in these problems is to optimize some function of the sum of a set of random variables. The difficulty is mainly due to the fact that the probability distribution of the sum is the convolution of a set of distributions, which is not an easy objective function to work with. To tackle this difficulty, we introduce the Poisson approximation technique. The technique is based on the Poisson approximation theorem discovered by Le Cam, which enables us to approximate the distribution of the sum of a set of random variables using a compound Poisson distribution. We first study the expected utility maximization problem introduced recently [Li and Despande, FOCS11]. For monotone and Lipschitz utility functions, we obtain an additive PTAS if there is a multidimensional PTAS for the multi-objective version of the problem, strictly generalizing the previous result. For the stochastic bin packing problem (introduced in [Kleinberg, Rabani and Tardos, STOC97]), we show there is a polynomial time algorithm which uses at most the optimal number of bins, if we relax the size of each bin and the overflow probability by eps. For stochastic knapsack, we show a 1+eps-approximation using eps extra capacity, even when the size and reward of each item may be correlated and cancelations of items are allowed. This generalizes the previous work [Balghat, Goel and Khanna, SODA11] for the case without correlation and cancelation. Our algorithm is also simpler. We also present a factor 2+eps approximation algorithm for stochastic knapsack with cancelations. the current known approximation factor of 8 [Gupta, Krishnaswamy, Molinaro and Ravi, FOCS11].Comment: 42 pages, 1 figure, Preliminary version appears in the Proceeding of the 45th ACM Symposium on the Theory of Computing (STOC13

Contextual appraisal of GM cotton diffusion in South Africa

L'essentiel de la production de coton en Afrique du Sud provient des fermiers à production commerciale, il est donc erroné de considérer l'adoption impressionnante de Coton Génétiquement Modifié (CGM) comme un exemple d'utilisation réussie par les petits producteurs. Le secteur coton sud-africain évolue dans un environnement instable de production et de commercialisation, et les petits producteurs en souffrent le plus en raison de leurs ressources financières limitées, de la faiblesse de leur production, de leurs faibles capacités de gestion et de commercialisation et de l'absence de choix de production alternative. La superficie totale en coton et le nombre de producteurs a diminué de manière drastique depuis l'introduction du CGM, ce phénomène amène les observateurs à remettre en cause le soi-disant "success story" du CGM en Afrique du Sud. L'expérience des petits producteurs dans ce pays montre que la seule introduction d'une technologie ne peut accroître durablement une production, les facteurs tels que les arrangements institutionnels jouent un rôle crucial. Les études antérieures avaient mis l'accent exclusivement sur la performance d'une technologie nouvelle en minimisant le rôle l'aspect institutionnel. Les résultats de notre recherche complète les études existantes en indiquant que la rentabilité de l'utilisation du CGM est faible dans un contexte défavorable sur le plan climatique et institutionnel. Ceci nous rappelle que l'agriculture pluviale est sensible aux aléas climatiques et que l'adoption d'une technologie nouvelle dans ces conditions peut accroître le risque financier lié à la production cotonnière.coton; Afrique du Sud; OGM; Bt; évaluation d'impact; rentabilité

Advanced Free Viewpoint Video Streaming Techniques

Free-viewpoint video is a new type of interactive multimedia service allowing users to control their viewpoint and generate new views of a dynamic scene from any perspective. The uniquely generated and displayed views are composed from two or more high bitrate camera streams that must be delivered to the users depending on their continuously changing perspective. Due to significant network and computational resource requirements, we proposed scalable viewpoint generation and delivery schemes based on multicast forwarding and distributed approach. Our aim was to find the optimal deployment locations of the distributed viewpoint synthesis processes in the network topology by allowing network nodes to act as proxy servers with caching and viewpoint synthesis functionalities. Moreover, a predictive multicast group management scheme was introduced in order to provide all camera views that may be requested in the near future and prevent the viewpoint synthesizer algorithm from remaining without camera streams. The obtained results showed that even 42% traffic decrease can be realized using distributed viewpoint synthesis and the probability of viewpoint synthesis starvation can be also significantly reduced in future free viewpoint video services

Redividing the Cake

A heterogeneous resource, such as a land-estate, is already divided among several agents in an unfair way. It should be re-divided among the agents in a way that balances fairness with ownership rights. We present re-division protocols that attain various trade-off points between fairness and ownership rights, in various settings differing in the geometric constraints on the allotments: (a) no geometric constraints; (b) connectivity --- the cake is a one-dimensional interval and each piece must be a contiguous interval; (c) rectangularity --- the cake is a two-dimensional rectangle or rectilinear polygon and the pieces should be rectangles; (d) convexity --- the cake is a two-dimensional convex polygon and the pieces should be convex. Our re-division protocols have implications on another problem: the price-of-fairness --- the loss of social welfare caused by fairness requirements. Each protocol implies an upper bound on the price-of-fairness with the respective geometric constraints.Comment: Extended IJCAI 2018 version. Previous name: "How to Re-Divide a Cake Fairly

Detecting wash trade in financial market using digraphs and dynamic programming

Wash trade refers to the illegal activities of traders who utilise carefully designed limit orders to manually increase the trading volumes for creating a false impression of an active market. As one of the primary formats of market abuse, wash trade can be extremely damaging to the proper functioning and integrity of capital markets. Existing work focuses on collusive clique detections based on certain assumptions of trading behaviours. Effective approaches for analysing and detecting wash trade in a real-life market have yet to be developed. This paper analyses and conceptualises the basic structures of the trading collusion in a wash trade by using a directed graph of traders. A novel method is then proposed to detect the potential wash trade activities involved in a financial instrument by first recognizing the suspiciously matched orders and then further identifying the collusions among the traders who submit such orders. Both steps are formulated as a simplified form of the Knapsack problem, which can be solved by dynamic programming approaches. The proposed approach is evaluated on seven stock datasets from NASDAQ and the London Stock Exchange. Experimental results show that the proposed approach can effectively detect all primary wash trade scenarios across the selected datasets

The Optimality of Simple Contracts: Moral Hazard and Loss Aversion

This paper extends the standard principal-agent model with moral hazard to allow for agents having reference- dependent preferences according to Köszegi and Rabin (2006, 2007). The main finding is that loss aversion leads to fairly simple contracts. In particular, when shifting the focus from standard risk aversion to loss aversion, the optimal contract is a simple bonus contract, i.e. when the agent's performance exceeds a certain threshold he receives a fixed bonus payment. Moreover, if the agent is sufficiently loss averse, it is shown that the first-order approach is not necessarily valid. If this is the case the principal may be unable to fine-tune incentives. Strategic ignorance of information by the principal, however, allows to overcome these problems and may even reduce the cost of implementation.Agency Model; Moral Hazard; Reference-Dependent Preferences; Loss Aversion