AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Simultaneous 2nd Price Item Auctions with No-Underbidding

Michal Feldman, Galia Shabtai

AAAI 2021 · Learning theory and algorithms › Submodular and game algorithms · approach: Learned auction design · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add iNUB to NOBS2PA with submodular valuations · Submodular, PoA (CCE)PoA lower bound: \frac{1}{2} -> \frac{2}{3}Improved
Combine NOB with iNUBS2PA with XOS valuations · XOS, PoAPoA: \frac{1}{2} -> \frac{1}{2}No clear effect
Impose sNUBS2PA with arbitrary monotone valuations · Monotone, BPoA (correlated distribution)BPoA lower bound: arbitrarily bad -> \frac{1}{2}Improved
Add sNUB to strong NOBS2PA with subadditive valuations · Subadditive, PoA (CCE)PoA lower bound: \frac{1}{2} -> \frac{2}{3}Improved
Add sNUB to NOBS2PA with subadditive valuations · Subadditive, BPoA (independent distribution)BPoA lower bound: \frac{1}{4} -> \frac{1}{2}Improved
Add NOB to sNUBS2PA with subadditive valuations · Subadditive, BPoABPoA lower bound: \frac{1}{2} -> \frac{1}{2}No clear effect
Use sNUB rather than iNUBS2PA with monotone valuations · Monotone, (B)PoA(B)PoA lower bound: arbitrarily bad -> \frac{1}{2}Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy