Mergers and acquisitions based on DEA approach
AbstractMergers and acquisitions (M&As) have become a more and more important topic in the management and development of companies. Companies usually conduct M&A to preserve or extend their competitive advantages. However, M&As usually fail in real life. For the given bidder company, a critical step to the success of M&A activities is the appropriate selection of target companies. Previous studies rarely considered the profile of the bidder company and its compatibility with candidate target companies. Although data envelopment analysis (DEA) has been applied in M&A, previous studies in this area haven't discussed the selection. In this paper, DEA was applied to support the decision making of mergers and acquisitions for decision making units (DMUs), i.e., the companies. We established a greedy algorithm to implement the selection process. This approach can make up the deficiencies of previous studies in some degree because it considers bidder and target company simultaneously.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Inderscience Enterprises Ltd in its journal Int. J. of Applied Management Science.
Volume (Year): 3 (2011)
Issue (Month): 3 ()
Contact details of provider:
Web page: http://www.inderscience.com/browse/index.php?journalID=286
mergers and acquisitions; M&A; returns to scale; RTS; data envelopment analysis; DEA; greedy algorithm; decision making units; DMUs.;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Graham Langley) or (Christopher F. Baum).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.