@InProceedings{mendoza08a,
  author =	 {Benito Mendoza and Jos\'{e} M. Vidal},
  title =	 {Approximate Bidding Algorithms for a Distributed
                  Combinatorial Auction (Short Paper)},
  booktitle =	 {Proceedings of the 7th International Conference on
                  Autonomous Agents and Multiagent Systems},
  year =	 2008,
  editor =	 {Padgham and Parkes and M\"{u}ller and Parsons},
  address =	 {Estoril, Portugal},
  month =	 {May},
  abstract =	 { Distributed allocation and multiagent coordination
                  problems can be solved through combinatorial
                  auctions (CAs). However, most of the existing winner
                  determination algorithms (WDAs) for CAs are
                  centralized. The PAUSE auction is one of a few
                  efforts to release the auctioneer from having to do
                  all the work. The pausebid bidding algorithm
                  generates myopically-optimal bids for agents in a
                  PAUSE auction but its running time is exponential on
                  the number of bids. We present new approximate
                  bidding algorithms that not only run in linear time
                  but also increase the utility of the bidders as
                  result of small decrement in revenue.},
  url = 	 {http://jmvidal.cse.sc.edu/papers/mendoza08a.pdf},
  comment = 	 {36\% acceptance rate.}
}