Francisco Cruz-Mencia

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The Coalition Structure Generation (CSG) problem is well-known in the area of Multi-Agent Systems. Its goal is to establish coalitions between agents while maximizing the global welfare. Between the existing different algorithms designed to solve the CSG problem, DP and IDP are the ones with smaller temporal complexity. After analyzing the operation of the(More)
Auctions, and combinatorial auctions (CAs), have been successfully employed to solve coordination problems in a wide range of application domains. However, the scale of CAs that can be optimally solved is small because of the complexity of the winner determination problem (WDP), namely of finding the bids that maximise the auctioneer's revenue. A way of(More)
The Winner Determination Problem (WDP) in Combinato-rial Auctions comes up in a wide range of applications. Linear Programming (LP) relaxations are a standard method for approximating combinatorial optimisation problems. In this paper we propose how to encode the WDP so that it can be approximated with AD 3. Moreover, we contribute with P AR-AD 3 , the(More)
  • 1