Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders. Dobzinski, S., Nisan, N., & Schapira, M. Math. Oper. Res., 35(1):1-13, 2010.
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders. [link]Link  Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders. [link]Paper  bibtex   
@article{journals/mor/DobzinskiNS10,
  added-at = {2010-07-21T15:46:45.000+0200},
  author = {Dobzinski, Shahar and Nisan, Noam and Schapira, Michael},
  biburl = {https://www.bibsonomy.org/bibtex/2494d8355bd685e5bc9a78f3b60ed5170/dblp},
  date = {2010-06-02},
  ee = {http://dx.doi.org/10.1287/moor.1090.0436},
  interhash = {826f9afbb4977e6b4a0126212a7a8d00},
  intrahash = {494d8355bd685e5bc9a78f3b60ed5170},
  journal = {Math. Oper. Res.},
  keywords = {dblp},
  number = 1,
  pages = {1-13},
  timestamp = {2010-07-21T15:46:45.000+0200},
  title = {Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders.},
  url = {http://dblp.uni-trier.de/db/journals/mor/mor35.html#DobzinskiNS10},
  volume = 35,
  year = 2010
}

Downloads: 0