Second-price ad auctions with binary bids and markets with good competition

DOI10.1007/978-3-642-32147-4_39zbMATH Open1371.91067OpenAlexW2110072039MaRDI QIDQ3167646FDOQ3167646

Authors: Cristina G. Fernandes, Rafael C. S. Schouery 

Publication date: 2 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_39

Recommendations

• Second-price ad auctions with binary bids and markets with good competition
• On Revenue Maximization in Second-Price Ad Auctions
• An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
• AdWords and generalized online matching
• Sponsored Search, Market Equilibria, and the Hungarian Method

zbMATH Keywords

approximation algorithmsmatchingscombinatorial auctions

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

Cited In (3)

• On Revenue Maximization in Second-Price Ad Auctions
• Second-price ad auctions with binary bids and markets with good competition
• The asymmetric matrix partition problem

This page was built for publication: Second-price ad auctions with binary bids and markets with good competition

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