Autor:	Vazirani, Vijay V.
Jazyk:	angličtina
Rok vydání:	2022
Předmět:	online algorithms competitive analysis ad auctions matching-based market design Theory of computation → Algorithmic game theory and mechanism design
DOI:	10.4230/lipics.mfcs.2022.5
Popis:	The purpose of this paper is to give a "textbook quality" proof of the optimal algorithm, called Ranking, for the online bipartite matching problem (OBM) and to highlight its role in matching-based market design. In particular, we discuss a generalization of OBM, called the adwords problem, which has had a significant impact in the ad auctions marketplace. LIPIcs, Vol. 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), pages 5:1-5:11
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::d98aa54ffed02c6100a27830800a1c4a Zobrazit plný text záznamu