Twenty Lectures on Algorithmic Game Theory

Key issue: tie-breaking. When two bidders submit the same highest bid for a single item, which one receives it? Section 2.4 of the 2016 English edition defines the second-price auction on p. 13. Footnote 4 on p. 14 acknowledges ties when proving Proposition 2.1. Stating a tie-breaking rule alongside the auction definition would let readers determine the winner for every bid profile.

The first reply gives a tied-bid example, a suggested addition to the definition, and the equality case in the proof.

蒂姆·拉夫加登著，郝东、李斌、刘凡译。机械工业出版社，2020 年。ISBN 978-7-111-64306-7。出版社书目与目录 (opens in a new tab)