Company mergers and acquisitions are often perceived to act as catalysts for corporate growth in free markets systems: it is conventional wisdom that those activities lead to better and more efficient markets. However, the broad adoption of this perception into corporate strategy is prone to result in a less diverse an…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “Mergers and Acquisitions”
Optimal execution strategy for merger & acquisition contracts with price impact.
problem Optimal execution and pricing of financial derivatives in M&A deals.
method Indifference utility arguments, considering linear and nonlinear contracts.
result Linear contracts are more expensive and vulnerable to manipulation.
The present work has as principal objective analyze the evolution of the process of privatization, mergers and acquisitions of the big companies in the country in the last decades, to understand the conductive threads that formed the structural changes of the economy, in order world oligopólicas to insert it to the glo…
Study examines how mergers and acquisitions affect Indian banks' financial performance and capital structure.
problem Impact of mergers and acquisitions on Indian banks' financial performance and capital structure.
method Statistical analysis using paired t-test on selected banks' annual reports.
result Mergers and acquisitions significantly impact financial performance and capital structure of Indian banks.
Study examines market reactions and spillovers in Japanese bank mergers using multiple methods.
problem Understanding valuation and spillover effects of bank mergers in the Japanese banking sector.
method Combines event study, VAR models, IRFs, and PSM to analyze two M&A events.
result Significant positive market reaction and prolonged positive spillovers detected.
Pakistan examines digital mergers using traditional competition tools.
problem Regulating digital mergers in a developing country.
method Empirical comparative analysis of CCP's M&A decisions.
result CCP uses same decision factors for digital and traditional M&As.
Mass algorithm predicts M&A deals from patent data.
problem Hard to automatically predict M&A deals due to complex human skills.
method Machine learning-based similarity measure (MASS) applied to patent data.
result MASS outperforms LightGCN in forecasting M&A deals.
Study analyzes COFCO's acquisition of Mengniu Dairy, revealing financial and non-financial impacts.
problem Understanding the impact of COFCO's acquisition of Mengniu Dairy.
method Analyzes financial and non-financial contributions of Mengniu Dairy to COFCO.
result Provides insights for future corporate M&A activities in the dairy industry.
Semi-analytic models are best suited to compare galaxy formation and evolution theories with observations. These models rely heavily on halo merger trees, and their realistic features (i.e., no drastic changes on halo mass or jumps on physical locations). Our aim is to provide a new framework for halo merger tree gener…
A Deep Learning Method for Predicting Mergers and Acquisitions: Temporal Dynamic Industry Networksq-fin.ST
Deep learning predicts M&A events in industry networks.
problem Predicting M&A behaviors in competitive industries with complex interdependencies.
method Temporal Dynamic Industry Network (TDIN) model using temporal point processes and deep learning.
result Effective M&A event prediction and actionable recommendations.
Illegal insider trading of stocks is based on releasing non-public information (e.g., new product launch, quarterly financial report, acquisition or merger plan) before the information is made public. Detecting illegal insider trading is difficult due to the complex, nonlinear, and non-stationary nature of the stock ma…
This article extends, in a stochastic environment, the Yagil (1987) model which establishes, in a deterministic dividend discount model, a range for the exchange ratio in a stock-for-stock merger agreement. Here, we generalize Yagil's work letting both pre- and post-merger dividends grow randomly over time. If Yagil fo…
New method resolves ambiguity in measuring black hole merger angular momentum.
problem Ambiguity in measuring angular momentum during black hole mergers.
method Quasilocal mass and optimal isometric embedding theory.
result New definition of angular momentum free of supertranslation ambiguity.
Stock markets are not what we think they are: the key roles of cross-ownership and corporate treasury stockcond-mat.other
We describe and document three mechanisms by which corporations can influence or even control stock prices. (i) Parent and holding companies wield control over other publicly traded companies. (ii) Through clever management of treasury stock based on buyback programs and stock issuance, stock price fluctuations can be …
The article improves the display of acceptable exchange ratios for merging companies.
problem Determining feasible exchange ratios for merging companies.
method Exploits a diagrammatic approach to display the bargaining region.
result Shares face upper and lower bounds for acceptable exchange ratios.
This paper provides a holistic study of how stock prices vary in their response to financial disclosures across different topics. Thereby, we specifically shed light into the extensive amount of filings for which no a priori categorization of their content exists. For this purpose, we utilize an approach from data mini…
Gravitational waves are predicted by the general theory of relativity. In [6] D. Christodoulou showed that gravitational waves have a nonlinear memory. We proved in [3] that the electromagnetic field contributes at highest order to the nonlinear memory effect of gravitational waves. In the present paper, we study this …
Deep neural network predicts black hole merger remnants with high accuracy.
problem Estimating the properties of black hole merger remnants.
method Trained on a dataset of binary black hole simulations, a deep neural network predicts mass and spin with high precision.
result The network predicts remnant black hole mass and spin with errors less than 0.04% and 0.3% respectively, and reduces errors in precessing cases to half.
New algorithm clusters GRBs into two groups: short and long duration.
problem Determining the number of clusters in gamma-ray bursts.
method Completely parameter-free clustering algorithm.
result Clusters indicate two main groups: short and long duration GRBs.
The FCA improved insider trading regulation after 2012, reducing abnormal returns.
problem Regulation of insider trading before and after the UK Financial Services Act 2012.
method Event study methodology using abnormal returns analysis.
result Abnormal returns were reduced after the FCA took over from the FSA.
Empirical researchers are increasingly faced with rich data sets containing many controls or instrumental variables, making it essential to choose an appropriate approach to variable selection. In this paper, we provide results for valid inference after post- or orthogonal -Boosting is used for variable selection.…
Predicting startup success using Crunchbase data and deep learning.
problem Predicting startup success in a volatile entrepreneurial ecosystem.
method Novel deep learning model integrating funding metrics, founder features, and industry category.
result Achieved 14 times capital growth and identified high-potential startups.
--- the companies populating a Stock market, along with their connections, can be effectively modeled through a directed network, where the nodes represent the companies, and the links indicate the ownership. This paper deals with this theme and discusses the concentration of a market. A cross-shareholding matrix is co…
Bayesian optimization is a sample-efficient approach to solving global optimization problems. Along with a surrogate model, this approach relies on theoretically motivated value heuristics (acquisition functions) to guide the search process. Maximizing acquisition functions yields the best performance; unfortunately, t…
We introduce deep learning models to estimate the masses of the binary components of black hole mergers, , and three astrophysical properties of the post-merger compact remnant, namely, the final spin, , and the frequency and damping time of the ringdown oscillations of the fundamental bar mo…
Evidence acquisition costs influence disclosure behavior and preference.
problem How evidence acquisition costs affect disclosure behavior and preference.
method Analyzes sender-receiver interactions with covert and overt evidence acquisition, varying certification costs.
result Equilibria converge to the Pareto-worst free-learning equilibrium as costs vanish, and receivers prefer covert to overt acquisition.
A concept of martingale-fair index of return, consistent with Arbitrage Free Pricing Theory, is introduced. An explicit formula for the average rate of return of a group of investment/pension funds in a discrete time stochastic model is derived and several properties of this index are shown. In particular, it is proven…
AFA evaluates AI feature acquisition strategies in domains with high costs.
problem Evaluate AI feature acquisition strategies in domains with high costs.
method Apply missing data methods and offline reinforcement learning under NDE and NUC assumptions.
result Propose a novel semi-offline reinforcement learning framework with three new estimators.
Bayesian optimization is a sample-efficient approach to global optimization that relies on theoretically motivated value heuristics (acquisition functions) to guide its search process. Fully maximizing acquisition functions produces the Bayes' decision rule, but this ideal is difficult to achieve since these functions …
The M and A transactions represent a wide range of unique business optimization opportunities in the corporate transformation deals, which are usually characterized by the high level of total risk. The M and A transactions can be successfully implemented by taking to an account the size of investments, purchase price, …
Inexact acquisition solutions in BO lead to sublinear cumulative regret.
problem Inexact maximization of acquisition functions in Bayesian optimization.
method Define inaccuracy measure, establish cumulative regret bounds for GP-UCB and GP-TS.
result Inexact BO algorithms can achieve sublinear cumulative regret under appropriate inaccuracy conditions.
A2MT learns agents to select which modalities to acquire at test time.
problem Learning agents to select modalities for multimodal temporal data acquisition.
method Perceiver IO architecture for active acquisition of multimodal temporal data.
result Agents successfully learn cost-reactive acquisition behavior on real-world datasets.
A simple method improves batch active learning without high compute.
problem Efficient batch active learning in machine learning.
method Adapting standard single-point acquisition strategies to batch.
result Simple strategy performs as well as advanced batch methods.
This paper explores optimising acquisition functions in Bayesian optimisation.
problem Optimising acquisition functions in Bayesian optimisation is challenging due to their non-convex nature.
method The authors derive compositional forms for acquisition functions and use them to recast maximisation as a compositional optimisation problem.
result The compositional approach to maximising acquisition functions shows empirical advantages across various tasks.
This paper optimizes Bayesian acquisition functions in Gaussian Processes for better optimization.
problem Improving the efficiency of Bayesian optimization methods.
method Analysis of different acquisition functions and optimizers for optimizing Bayesian acquisition functions.
result Optimization of acquisition functions leads to faster and more accurate sampling points.
Predicting Status of Pre and Post M&A Deals Using Machine Learning and Deep Learning Techniquesq-fin.GN
Paper predicts M&A deal success using ML and DL techniques.
problem Predicting the success of M&A deals to avoid costly mistakes.
method Data preprocessing with ML techniques, feedforward neural networks, and sentiment scores integration.
result Methodology outperforms benchmark models in preliminary tests.
Optimizes information acquisition to reduce estimation risk and maximize utility.
problem Estimation risk in investor decision-making.
method Derives closed-form value functions using CARA and CRRA utility functions, employs variational methods to explore optimal acquisition.
result Acquiring information earlier is more valuable in reducing estimation risk and achieving higher utility.
Optimizes data acquisition in high-dimensional Bayesian optimization.
problem Suboptimal data acquisition in high-dimensional Bayesian optimization tasks.
method Utility-calibrated variational inference to align approximations with BO goals.
result Optimal data acquisition decisions under a limited computational budget.
Efficiently reduces computational burden of rollout acquisition functions in Bayesian optimization.
problem Expensive computation of rollout acquisition functions in Bayesian optimization.
method Combines quasi-Monte Carlo, common random numbers, and control variates to reduce computational burden. Formulates a policy-search approach to eliminate the need to optimize the rollout acquisition function.
result Significant reduction in computational burden of rollout acquisition functions.
NM-PPG optimizes adaptive feature acquisition in POMDPs for better predictions.
problem Optimizing adaptive feature acquisition in prediction problems with costly features.
method Non-myopic pathwise policy gradients (NM-PPG) with continuous relaxation and straight-through rollout.
result NM-PPG outperforms state-of-the-art AFA methods on synthetic and real-world datasets.
Boundary effects inflate variance in Gaussian processes, leading to acquisition bias.
problem Boundary-induced acquisition bias in Gaussian processes.
method Traced root cause to geometric mechanism of kernel truncation at domain boundaries.
result Boundary effects create distortion that worsens with dimensionality, affecting acquisition behavior.
Unified framework connects EI and information-theoretic acquisition functions.
problem Distinguish between Expected Improvement and information-theoretic acquisition functions.
method Introduces Variational Entropy Search (VES) to unify EI and information-theoretic approaches.
result EI can be seen as a variational inference approximation of Max-value Entropy Search (MES).
Proposes a new acquisition function for batched Bayesian optimization.
problem Intractability of acquisition functions for batched Bayesian optimization.
method Statistical physics inspired acquisition function for Gaussian processes.
result Demonstrates competitive performance on various problems.
Dynamic acquisition of features improves predictions with limited data.
problem Limited or uncertain data requires additional relevant information for accurate assessments.
method Proposes models that dynamically acquire new features using conditional mutual information and arbitrary conditional flow.
result Demonstrates superior performance over baselines in multiple settings.
This paper optimizes sampling policies for Bayesian optimization to improve exploration and exploitation.
problem Improving the balance between exploration and exploitation in Bayesian optimization.
method Developed efficient methods to estimate and optimize non-myopic acquisition functions using rollout policies and stochastic gradient optimization.
result Efficient optimization of sampling policies leads to better performance in Bayesian optimization.
New acquisition function improves batch Bayesian active learning.
problem BatchBALD conflates epistemic and aleatoric uncertainty, leading to suboptimal performance.
method Focus on predictive probabilities to separate epistemic uncertainty, leading to better performance and faster evaluation.
result The new acquisition function performs better and allows for larger batches.
We consider the problem of active feature acquisition, where we sequentially select the subset of features in order to achieve the maximum prediction performance in the most cost-effective way. In this work, we formulate this active feature acquisition problem as a reinforcement learning problem, and provide a novel fr…
We develop BatchBALD, a tractable approximation to the mutual information between a batch of points and model parameters, which we use as an acquisition function to select multiple informative points jointly for the task of deep Bayesian active learning. BatchBALD is a greedy linear-time -approximate a…