Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets: 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 02:0202:02, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,713 bytes +2,713‎ Created page with "Title: Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets Abstract: This research study focuses on the problem of multiple-object auctions, where each bidder tries to win as many objects as possible with a bidding algorithm. The study specifically examines position-randomized auctions, a special class of multiple-object auctions where a bidding algorithm consists of an initial bid sequence and an algorithm for randomly permuting the sequence. The re..."
Retrieved from "https://simplesci.org/wiki/Optimal_Bid_Sequences_for_Multiple-Object_Auctions_with_Unequal_Budgets"