Bidding Languages for Auction-based Distributed Scheduling

The kind of bidding languages used in combinatorial auctions contributes to various aspects of computational complexities. General bidding languages use bundles of distinct items as atomic propositions associated with logical connectives. When applying these languages to auctionbased scheduling, the scheduling timeline needs to be discretized into fixed time units. We show that this discretization approach is computationally expensive in terms …