Skip to main navigation Skip to search Skip to main content

Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers

  • Tomer Ezra
  • , Michal Feldman
  • , Eric Neyman
  • , Inbal Talgam-Cohen
  • , Matt Weinberg

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fingerprint

Dive into the research topics of 'Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers'. Together they form a unique fingerprint.
Sort by

Computer Science

Keyphrases

Mathematics