Nearest Neighbor Classification and Search

DOI10.1017/9781108637435.024MaRDI QIDQ5027293zbMATH OpenOpenAlexFDO

Authors Inbal Talgam-Cohen

Publication date 4 February 2022

Full work available at URL https://www.cambridge.org/core/books/beyond-the-worstcase-analysis-of-algorithms/priorindependent-auctions/1A9309917AD07EEE1649D7D87EDBDFF6

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• Prior-free auctions with ordered bidders
• Prior-free clock auctions for bidders with interdependent values
• Prior-free multi-unit auctions with ordered bidders
• Auctions with interdependent valuations
• Optimal deterministic auctions with correlated priors
• A Prior-Independent Revenue-Maximizing Auction for Multiple Additive Bidders
• Auctions for partial heterogeneous preferences
• Asymptotically optimal prior-free clock auctions
• Sequentially optimal auctions
• Optimal auctions revisited

Cited in

(2)

• Regret-minimizing Bayesian persuasion
• Auction design with heterogeneous priors

This page was built for publication: Nearest Neighbor Classification and Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5027293)