{'fraction_non_alphanumeric': 0.008097165991902834, 'fraction_numerical': 0.0, 'mean_word_length': 5.780821917808219, '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 ITERATIVE AUCTION MECHANISM FOR COMBINATORIAL LOGISTICS EXCHANGES

Transportation or logistics exchanges help shippers and carriers to save costs and increase their revenue at the same time. Auction based models are increasingly becoming popular as the negotiation model in such exchanges. In this paper, we propose an iterative auction model for efficiently solving the allocation problem in combinatorial logistics exchanges which allow combinatorial bidding by both shippers and carriers.