Secretary markets with local information
From MaRDI portal
Publication:3449504
DOI10.1007/978-3-662-47666-6_44zbMATH Open1447.91082OpenAlexW1919540593MaRDI QIDQ3449504FDOQ3449504
Authors: Ning Chen, Martin Hoefer, Marvin Künnemann, Peihan Miao, Chengyu Lin 
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_44
Recommendations
Cites Work
- AdWords and generalized online matching
- Title not available (Why is that?)
- Matroid secretary problem in the random-assignment model
- A multiple-choice secretary algorithm with applications to online auctions
- Matroids, secretary problems, and online mechanisms
- Matroid secretary for regular and decomposable matroids
- Primal beats dual on online packing LPs in the random-order model
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Secretary problems: laminar matroid and interval scheduling
- Online bipartite matching with unknown distributions
- Competitive weighted matching in transversal matroids
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- Geometry of online packing linear programs
- Dynamic Programming and Decision Theory
- Advances on matroid secretary problems: free order model and laminar case
- Near optimal online algorithms and fast approximation algorithms for resource allocation problems
- An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
- Online independent set beyond the worst-case: secretaries, prophets, and periods
- Matroid Secretary Problems
- Dueling algorithms
Cited In (3)
This page was built for publication: Secretary markets with local information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449504)
