3,666 research outputs found

    Feedback Effects and the Limits to Arbitrage

    Get PDF
    This paper identifies a limit to arbitrage that arises from the fact that a firm's fundamental value is endogenous to the act of exploiting the arbitrage. Trading on private information reveals this information to managers and helps them improve their real decisions, in turn enhancing fundamental value. While this increases the profitability of a long position, it reduces the profitability of a short position -- selling on negative information reveals that firm prospects are poor, causing the manager to cancel investment. Optimal abandonment increases firm value and may cause the speculator to realize a loss on her initial sale. Thus, investors may strategically refrain from trading on negative information, and so bad news is incorporated more slowly into prices than good news. The effect has potentially important real consequences -- if negative information is not incorporated into stock prices, negative-NPV projects may not be abandoned, leading to overinvestment.

    ARPA Whitepaper

    Get PDF
    We propose a secure computation solution for blockchain networks. The correctness of computation is verifiable even under malicious majority condition using information-theoretic Message Authentication Code (MAC), and the privacy is preserved using Secret-Sharing. With state-of-the-art multiparty computation protocol and a layer2 solution, our privacy-preserving computation guarantees data security on blockchain, cryptographically, while reducing the heavy-lifting computation job to a few nodes. This breakthrough has several implications on the future of decentralized networks. First, secure computation can be used to support Private Smart Contracts, where consensus is reached without exposing the information in the public contract. Second, it enables data to be shared and used in trustless network, without disclosing the raw data during data-at-use, where data ownership and data usage is safely separated. Last but not least, computation and verification processes are separated, which can be perceived as computational sharding, this effectively makes the transaction processing speed linear to the number of participating nodes. Our objective is to deploy our secure computation network as an layer2 solution to any blockchain system. Smart Contracts\cite{smartcontract} will be used as bridge to link the blockchain and computation networks. Additionally, they will be used as verifier to ensure that outsourced computation is completed correctly. In order to achieve this, we first develop a general MPC network with advanced features, such as: 1) Secure Computation, 2) Off-chain Computation, 3) Verifiable Computation, and 4)Support dApps' needs like privacy-preserving data exchange

    Models of Customer Behavior: From Populations to Individuals

    Get PDF
    There have been various claims made in the marketing community about the benefits of 1-to-1 marketing versus traditional customer segmentation approaches and how much they can improve understanding of customer behavior. However, few rigorous studies exist that systematically compare these approaches. In this paper, we conducted such a systematic study and compared the performance of aggregate, segmentation, and 1-to-1 marketing approaches across a broad range of experimental settings such as multiple segmentation levels, multiple real world marketing datasets, multiple dependent variables, different types of classifiers, different segmentation techniques, and different predictive measures. Our results show that, overall, 1-to-1 modeling significantly outperforms the aggregate approach among high-volume customers and is never worse than aggregate approach among low-volume customers in our experimental settings. Moreover, the best segmentation techniques tend to outperform 1-to-1 modeling among low-volume customers.Information Systems Working Papers Serie

    BART-SIMP: a novel framework for flexible spatial covariate modeling and prediction using Bayesian additive regression trees

    Full text link
    Prediction is a classic challenge in spatial statistics and the inclusion of spatial covariates can greatly improve predictive performance when incorporated into a model with latent spatial effects. It is desirable to develop flexible regression models that allow for nonlinearities and interactions in the covariate structure. Machine learning models have been suggested in the spatial context, allowing for spatial dependence in the residuals, but fail to provide reliable uncertainty estimates. In this paper, we investigate a novel combination of a Gaussian process spatial model and a Bayesian Additive Regression Tree (BART) model. The computational burden of the approach is reduced by combining Markov chain Monte Carlo (MCMC) with the Integrated Nested Laplace Approximation (INLA) technique. We study the performance of the method via simulations and use the model to predict anthropometric responses, collected via household cluster samples in Kenya

    Improvements on Scalable Stochastic Bayesian Inference Methods for Multivariate Hawkes Process

    Full text link
    Multivariate Hawkes Processes (MHPs) are a class of point processes that can account for complex temporal dynamics among event sequences. In this work, we study the accuracy and computational efficiency of three classes of algorithms which, while widely used in the context of Bayesian inference, have rarely been applied in the context of MHPs: stochastic gradient expectation-maximization, stochastic gradient variational inference and stochastic gradient Langevin Monte Carlo. An important contribution of this paper is a novel approximation to the likelihood function that allows us to retain the computational advantages associated with conjugate settings while reducing approximation errors associated with the boundary effects. The comparisons are based on various simulated scenarios as well as an application to the study the risk dynamics in the Standard & Poor's 500 intraday index prices among its 11 sectors
    corecore