Benny Lehmann: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 04:0904:09, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,717 bytes +1,717‎ Created page with "Title: Benny Lehmann Main Research Question: How do submodular valuations, which exhibit no complementarities, affect the allocation problem in combinatorial auctions? Methodology: The researchers used combinatorial auctions as a case study to explore the implications of submodular valuations, which exhibit no complementarities. They developed an efficient greedy 2-approximation algorithm for this case and generalized it to the case of limited complementarities. Resul..."
Retrieved from "https://simplesci.org/wiki/Benny_Lehmann"