scientific article; zbMATH DE number 7051296
From MaRDI portal
Publication:4633940
zbMath1422.68336MaRDI QIDQ4633940
Kunal Talwar, Nicole Immorlica, Moshe Babaioff, Michael Dinitz, Anupam Gupta
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496905
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Auctions, bargaining, bidding and selling, and other market models (91B26) Probabilistic games; gambling (91A60) Online algorithms; streaming algorithms (68W27)
Related Items (10)
The simulated greedy algorithm for several submodular matroid secretary problems ⋮ Optimal algorithms for the online time series search problem ⋮ Secretary and online matching problems with machine learned advice ⋮ Generalized Sequential Stochastic Assignment Problem ⋮ The Submodular Secretary Problem Goes Linear ⋮ Online algorithms for the multiple time series search problem ⋮ Secretary markets with local information ⋮ On variants of the matroid secretary problem ⋮ Worst-Case Mechanism Design via Bayesian Analysis ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem
This page was built for publication:
