SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
An improved approximation algorithm for combinatorial auctions with submodular bidders
0 references·2 citing·8 second hop
An improved approximation algorithm for combinatorial auctions with submodular bidders (2006)An improved approximation algorithm for c…Limitations of Randomized Mechanisms for Combinatorial Auctions (2011)Limitations of Randomized Mec…Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions (2007)Inapproximability Results for…Combinatorial Auctions: A Survey (2003)Putting Auction Theory to Work (2004)The Lovely but Lonely Vickrey Auction (2005)Price of Anarchy for Greedy Auctions (2010)Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders (2016)The English Auction with Differentiated Commodities (2000)Algorithm for optimal winner determination in combinatorial auctions (2002)The communication requirements of efficient allocations and supporting prices (2005)
this work references cited by second hop

References

No references inside the corpus for this window.

Cited by

  • 2011Limitations of Randomized Mechanisms for Combinatorial Auctions40 cited
  • 2007Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions39 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work