AI Paper Atlas

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

All-Pay Bidding Games on Graphs

Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec

AAAI 2020 · Learning theory and algorithms › Submodular and game algorithms · approach: Correlated equilibria in sequential games

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 all-pay rather than first-price biddingTic-tac-toe · Tic-tac-toesurely-winning threshold ratio: 133/123 ≈ 1.0183 -> 51/31 ≈ 1.65Hurt
Use all-pay rather than first-price biddingTic-tac-toe · Tic-tac-toesurely-winning threshold ratio: roughly 1.0184 -> 51/31 ≈ 1.65Hurt
Allow probabilistic bidding strategiesWnR(2) · WnR(2), B1 in (1, 2), B2 = 1game value: 1/(n+1)Improved
Require Player 1 to win three auctions in a rowWnR(3) · WnR(3), B1 = 1.25, B2 = 1optimal strategy support: infinite supportHurt
Discretize bids in increments of ε and use the FPTASAll-pay bidding games on DAGs · DAG gamesapproximation boundsImproved

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