{'fraction_non_alphanumeric': 0.013918629550321198, 'fraction_numerical': 0.0, 'mean_word_length': 5.404109589041096, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Multi Unit Auctions with Constraints in Financial Domain

One of the very important applications of auctions in many countries in last few years in financial domain has been privatization of state owned enterprises. Traditionally auction based mechanisms have been used for leasing of mining rights, bandwidth allocation etc. In last few years there has been growing interest in Internet based market places because of wide spread use of auction based protocols for electronic commerce. Many Internet based sites have implemented different types of auctions. In this paper we analyze the problem of initial public offering (IPO) of Government owned companies. We also consider scenario with different types of constraints. We formulate this problem as nonlinear integer programming problem. An algorithm, which computes the optimum solution, has been developed. The algorithm generates optimum solution with polynomial time complexity