Multiagent Coordination Using a Distributed Combinatorial Auction

1. MultiagentCoordination Using a Distributed Combinatorial Auction Jose M. Vidal University of South Carolina AAAI Workshop on Auction Mechanisms for Robot Coordination, 2006

2. Multiagent Coordination Using a Distributed Combinatorial Auction • Combinatorial auctions are a great way to represent and solve distributed allocation problems. • Problem: most of the winner determination solutions that exists are centralized.

3. This paper suggest using The (the Progressive Adaptive User Selection Environment )PAUSE auction which is an increasing-price combinatorial auction and the problem of winner determination is distributed amongst the bidders. • is providing a bidding algorithm for agents in a PAUSE auction, the PAUSEBID algorithm. • This algorithm always return the bid which is maximizing the bidders utility.

4. Combinatorial auction • PAUSE auction • PAUSEBID algorithm • analysis • test

5. Combinatorial Auctions • has been the most widely used auction in multiagent systems. • agents can place bids for sets of items instead of just placing one bid for each item for sale. • has been used in many systems where there is a set of tasks need to distributed between agents with different preferences.

6. Example for Combinatorial Auctions correct solution :accept both the $8 bid and the $6 bid.

7. Researchs on Combinatorial Auctions • CA is applicable to a large number of distributed allocation problems and multiagent coordination problems (Cramton, Shoham, & Steinberg 2006). • Centralized Winner determination algorithms • CASS (Fujishima, Leyton-Brown, & Shoham 1999) • Bidtree (Sandholm2002) • CABOB (Sandholm et al. 2005)

8. Researches on Combinatorial Auctions • These centralize actions don’t fit multiagent systems where: • Agents own computational resources • Agents have localized information • PAUSE auction has been developed and distribute the winner determination problem among agents

9. The PAUSE Auction • m stages for m items • Stage 1: simultaneous ascending price open-cry auctions for each individual item • Stage k =2, 3, . . . ,m: bidders must submit sets of bids that cover all goods but each one of the bids must be for k goods or less.

10. The PAUSE Auction • Each bid b composed of bitems:the set of items the bid is over bvalue : the valueor price of the bid bagent : the agent that placed the bid b {bitems, bvalue, bagent} • At the end of each stage k, set B { b1, b2,b3,..} of the current best bids is generating and all agents know the best bid for every subset of size k or less.

11. The PAUSE Auction at each stage k>1 : • bidders can use bids from other agents from previous round. • The sum of bid prices in each submitted bid set should be bigger than currently winning bid set. • There will be a set of currently winning bids which maximizing the revenue.

12. The PAUSE Auction • also at each stage the goal of each agent i is to maximizing it’s utility where vi is the value function for this agent is: • Agent i must find g* such that and

13. The PAUSE Auction • the final winning bid set will be one such that no agent can propose a better bid set. • PAUSE auction has been shown to be envy-free since no bidder would prefer to exchange his allocation with that of any other bidders.

14. Eliminating the auctioneer • To eliminate the auctioneer, all bids are broadcast • when an agent receives a bid from another agent • it updates the set of best bids. • Determine if the new bid is better than the current winning bid.

15. Formulation • g is a set of bids all taken from B such that g covers all the items. • g* is a set of bids such that:

16. Bidding Algorithm

17. Search Algorithm

18. Analysis • The PAUSEBID algorithm implement the same strategy as English auction such that the agents places the bid which maximize its own utility and has the revenue greater than the current winning bid.

19. Analysis • The PAUSEBID algorithm has certain weaknesses: • the agent surplus has been distributed(proportionately to the agent’s valuation for items) across his bids on g* • Example • solution: change the surplus solution method to include some randomness

20. Analysis because of these weaknesses: • The PAUSEBID strategy Is not a dominant strategy. • But when its called , it returns the bid that increase and maximize the agents utility. • If the whole system use it, the solution would be the same as the one by a centralize winner determination algorithm.

21. Testing the PAUSE Auction • Tested where a a set of agents must perform a set of tasks but there are cost savings for particular agents if they can bundle together certain subsets of tasks. • The result was in 95% of runs similar to the result from CASS. • The revenue of PAUSE auction is always smaller.

22. Future work • Improve the performance of the PAUSEBID algorithm by using caching techniques similar to centralized algorithm(CABOB). • Developing ways that agents may cooperate in order to minimize any redundant work. • Eliminating the need for the agent to constantly broadcast new bids and use multicasting method instead.