AI Paper Atlas

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

Optimal Pricing for Submodular Valuations with Bounded Curvature

Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi

AAAI 2017 · Learning theory and algorithms › Submodular and game algorithms · approach: Learned auction design · 6 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
Use the proposed pricing algorithm instead of Scaled pricingSingle-buyer pricing · Uniformprofit ratio: 0.98 -> 1.00Improved
Use the proposed pricing algorithm instead of Scaled pricingSingle-buyer pricing · PowerLawprofit ratio: 0.98 -> 1.00Improved
Use the proposed pricing algorithm instead of Scaled pricingSingle-buyer pricing · Last.fmprofit ratio: 0.99 -> 1.00Improved
Use the proposed pricing algorithm instead of Scaled pricingSingle-buyer pricing · MovieLensprofit ratio: 0.96 -> 1.00Improved
Use the proposed pricing algorithm instead of SellAllSingle-buyer pricing · BookCrossingprofit ratio: 1.00 -> 1.00No clear effect
Increase the number of advertisersNon-collaborating advertisers · Uniform and PowerLaw networksprofitNo clear effect
Increase the number of advertisersCollaborating advertisers · Uniform and PowerLaw networksprofitImproved
Allow advertisers to collaborate rather than act independentlyAdvertiser pricing · Uniform and PowerLaw networksprofitImproved

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