Extends Yagil's model to include stochastic dividends in stock-for-stock mergers.
problem Determining exchange ratios in stock-for-stock mergers with uncertain dividend growth.
method Generalizes Yagil's deterministic model to a stochastic environment, considering both expected values and variance of dividends.
result Identifies a more complex bargaining region for exchange ratios, influenced by the mean and standard deviation of dividends' growth rate.
Generative Adversarial Network creates realistic halo merger trees.
problem Comparing galaxy formation theories with observations using halo merger trees.
method Treated halo merger tree construction as a matrix generation problem, using Generative Adversarial Network.
result Generated halo merger trees are of high quality and realistic.
Analyzes privatizations, mergers, and acquisitions in Mexico's big companies.
problem Understanding economic structural changes and global market insertion.
method Examines the evolution of privatizations, mergers, and acquisitions in Mexico's large companies over the past decades.
result Identifies conductive threads leading to economic changes and global market insertion.
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…
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.
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.
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.
Deep learning models estimate black hole merger parameters and post-merger properties.
problem Estimating masses and properties of black hole mergers.
method Modified WaveNet architecture with contrastive learning and normalizing flow.
result Deep learning models produce statistically consistent results and similar posterior distributions to traditional Bayesian methods.
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.
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.
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.
Solves a 60-year-old question on agreement measures in statistics.
problem The challenge of measuring agreement between two raters or measures.
method Developed a new algorithm to minimize diagonals in contingency tables, formulated the minimum feasible agreement, and studied the lower limit of maximum feasible agreement.
result Formulated the lower limit of Cohen's kappa and two statistics for agreement analysis.
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.
The paper provides methods for valid inference in high-dimensional settings using L2-Boosting.
problem Valid inference in high-dimensional settings with many controls or instruments.
method Post- or orthogonal L2-Boosting for variable selection in high-dimensional settings. result Valid inference results for treatment effects in high-dimensional settings.
An explicit solution found for maximizing/minimizing agreement in a 2x2 table.
problem Maximizing or minimizing agreement between clusterings with given marginals.
method Formal framework for several agreement measures, explicit solution for 2x2 table.
result An explicit solution for the 2x2 case.
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…
This work introduces significativity indices for agreement values between classifiers.
problem Evaluating the quality of agreement measures between classifiers.
method Proposes general approach and two specific indices for evaluation.
result Introduces two new significativity indices for evaluating agreement values.
SNAP improves robust computation by emphasizing trustworthy items and downweighting outliers.
problem Improving robustness in computation, especially in high-dimensional settings.
method SNAP assigns weights based on mutual agreement, suppressing outlier contributions.
result SNAP ensures outliers contribute negligibly to computations, even in high-dimensional settings.
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.
Paper tackles zero-shot translation by encouraging consistent agreement in models.
problem Challenges of generalizing multilingual translation without parallel data.
method Reformulated as probabilistic inference, introduced consistent agreement-based training.
result Agreement-based learning improves zero-shot translation by 2-3 BLEU points.
Are large scale research programs that include many projects more productive than smaller ones with fewer projects? This problem of economy of scale is particularly relevant for understanding recent mergers in particular in the pharmaceutical industry. We present a quantitative theory based on the characterization of d…
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.
Proposes a new learning framework to prevent model selection pitfalls.
problem Model selection issues in machine learning.
method Encourages multiple models to agree on predictions during training.
result Framework significantly outperforms alternatives in practice.
The paper analyzes indices based on counting object pairs for assessing partition agreement in unsupervised learning.
problem The difficulty in interpreting overall indices like Rand and adjusted Rand indices.
method Analysis of three families of indices based on counting object pairs, decomposing overall indices into cluster-level indices.
result Overall indices based on pair-counting approach are sensitive to cluster size imbalance and provide limited information on smaller clusters.
Discriminatory trade liberalization policies are becoming more popular among world economies. Countries are motivated to enter for regional trade agreements to capture faster economic growth for alleviating poverty. In developing economies like most of the member countries of the Association of South East Asian Nations…
LFD method improves text classification by making features clearer and less label-leaking.
problem Creating interpretable text representations that are both predictive and understandable.
method LFD method: proposes lexical and semantic features from contrastive text pairs, screens candidates using κ, and selects features by residual gain. result LFD features achieve higher human-human and human-LLM agreement than baseline concepts and are less label-leaking.
Formula found for minimum ARI between clusterings of fixed sizes.
problem Understanding the lowest possible agreement between clusterings.
method Explicit formula derivation for minimum ARI.
result A specific pair of clusterings achieving the minimum ARI is provided.
In many machine learning problems, labeled training data is limited but unlabeled data is ample. Some of these problems have instances that can be factored into multiple views, each of which is nearly sufficent in determining the correct labels. In this paper we present a new algorithm for probabilistic multi-view lear…
In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph G with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreements: the number of all `+' edges within clusters plus all `-' edges cut across clusters. BCC is known to be NP-hard. We present a novel approx…
Constructs solutions of Einstein equations for black holes gluing along timelike geodesics.
problem Constructing solutions of Einstein equations for black holes gluing along timelike geodesics.
method Constructs solutions gε of the Einstein equations describing a mass ε Kerr black hole traveling along a timelike geodesic C. result Constructs true solutions gε of the Einstein equations for black holes gluing along timelike geodesics. Algorithm for agents to agree on a single objective in multi-task networks.
problem Decentralized decision-making in multi-task networks with multiple objectives.
method Distributed decision-making algorithm for agents observing different models.
result Agents reach agreement on which model to track for network performance enhancement.
A new method for combining multiple data views in supervised learning.
problem Combining multiple data views in supervised learning, especially in biology and medicine.
method Cooperative learning combines squared error loss with an agreement penalty to encourage predictions from different data views to agree.
result Cooperative learning achieves higher predictive accuracy on simulated and real multiomics data.
The paper proposes a method to trim Bayesian network classifiers robustly.
problem Removing costly features from Bayesian network classifiers while maintaining robustness.
method Introduces an expected classification agreement (ECA) metric and a branch-and-bound search algorithm to find optimal feature subsets and thresholds.
result The proposed method maximizes expected agreement between the original and trimmed classifiers, subject to a budgetary constraint.
AVRA automatically rates brain atrophy from MRI images, achieving high agreement with human radiologists.
problem Manual visual rating of brain atrophy by radiologists is time-consuming and inconsistent.
method AVRA uses machine learning, trained on 2350 ratings, to automatically rate various atrophy scales.
result AVRA achieves substantial agreement with human radiologists, with Cohen's weighted kappa values of 0.74-0.74.
Computable contracts simplify financial transactions and reduce legal costs.
problem Difficulty in querying, executing, and analyzing text-based financial contracts.
method Develop a Contract Definition Language and illustrate use cases.
result Substantial improvements in customer experience and cost reduction.
We apply an asymmetric version of Kirman's herding model to volatile financial markets. In the relation between returns and agent concentration we use the square root law proposed by Zhang. This can be derived by extending the idea of a critical mean field theory suggested by Plerou et al. We show that this model is eq…
Study finds simple model-agreement scores perform well in various error estimation scenarios.
problem Evaluating model performance on unseen distributions using disparate scoring functions.
method Rigorously studied popular scoring functions (confidence, local manifold smoothness, model agreement) independently of mechanism choice.
result Simple model-agreement scores outperform confidence- and smoothness-based scores in realistic settings with compromised training data.
A novel clustering method uses torque balance to group objects.
problem Grouping similar objects in various scientific fields.
method Inspired by gravitational interactions, a parameter-free clustering algorithm based on mass and distance.
result The algorithm effectively clusters objects regardless of their shape, size, or density.
Researchers develop multi-agent systems for quadcopters to collaborate in missions.
problem Enable multiple quadcopters to work together in remote sensing tasks.
method Agent dynamics, network topologies, collective behaviors, agreement protocol, equations of motion for quadcopters.
result Multi-agent systems can successfully collaborate in remote sensing missions.
Study shows more data improves model explanations, aiding reliable knowledge extraction.
problem Challenges in deriving reliable knowledge from machine learning models due to the Rashōmon effect.
method Examined the influence of sample size on explanations from models in a Rashōmon set using SHAP.
result Explanations from <128 samples are highly variable, but agreement improves with more data.
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.
There is considerable debate whether the domestic political institutions (specifically, the country s level of democracy) of the host developing country toward foreign investors are effective in establishing the credibility of commitments are still underway, researchers have also analyzed the effect of international in…
Unified framework for policy learning using weak supervision.
problem High-quality supervision is often infeasible or expensive in practice.
method Treat weak supervision as imperfect peer information and evaluate policies based on correlated agreement.
result Substantial performance improvements, especially in complex or noisy environments.
As part of Basel II's incremental risk charge (IRC) methodology, this paper summarizes our extensive investigations of constructing transition probability matrices (TPMs) for unsecuritized credit products in the trading book. The objective is to create monthly or quarterly TPMs with predefined sectors and ratings that …