{'fraction_non_alphanumeric': 0.018518518518518517, 'fraction_numerical': 0.0, 'mean_word_length': 5.236263736263736, '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}}
An approach to vickrey-based resource allocation in the presence of monopolistic sellers

Market-based approaches proposed recently proved to be promising for competitive resource sharing in peer-to-peer and grid computing. Many approaches leverage on the Vickrey-Clarke-Groves (VCG) mechanism to achieve incentive compatibility which embraces truthful bidding of participating agents. This paper addresses a deficiency of VCG that to the best of our knowledge has not been studied. When one or more agents possess a large portion of the market share of resource, a monopoly situation arises. Applying VCG mechanism does not lead to an allocation because the second price cannot be mathematically determined. Using both theoretical and simulation analysis, we show the importance of addressing this problem. Our results show that monopoly situation arises in many types of market settings, from auction to exchange, and with a relatively high occurrence rate. To address this, we propose a new pricing method suitable for many market settings that achieve budget balanced and economic efficiency but relax the strategy proof property.