Scalable multi-agent learning algorithms to determine winners in combinatorial double auctions
Many complex decision problems in the real world are very difficult to solve due to computational complexity. The winner determination problem (WDP) in combinatorial double auctions is one example of such complex problems. Although it allows buyers and sellers to submit bids and trade goods conveniently, the WDP in combinatorial double auctions is notoriously difficult to solve from computation point of view. It relies on the development of an effective mechanism to determine the winners. Multi-agent systems (MAS) provide an approach in which several agents attempt, through their interactions, to jointly solve a problem. An important issue in MAS is the design of multi-agent learning algorithms. In this paper, we will study the development of scalable multi-agent learning algorithms for solving the WDP in combinatorial double auctions. Instead of finding the exact solution, we will set up a fictitious market based on MAS architecture and develop multi-agent learning algorithms to reduce the computational complexity in solving the WDP of combinatorial double auctions. In the fictitious market, each buyer, each seller and the mediator is modeled by an agent. The issue is to develop learning algorithms for all the agents in the system to collectively solve the WDP in combinatorial double auctions. In this paper, we adopt a Lagrangian relaxation approach and a subgradient method to develop efficient multi-agent learning algorithms for solving the WDP in combinatorial double auctions. The effectiveness of the proposed multi-agent learning algorithms is also demonstrated by numerical examples.
multi-agent learning auction