Secretary markets with local information

DOI10.1007/S00446-018-0327-5zbMATH Open1447.91083OpenAlexW2793085254MaRDI QIDQ2010597FDOQ2010597

Authors: Ning Chen, Martin Hoefer, Marvin Künnemann, Peihan Miao, Chengyu Lin 

Publication date: 27 November 2019

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-018-0327-5

Recommendations

• Secretary markets with local information
• Stable secretaries
• Submodular secretary problem and extensions
• Submodular secretary problem and extensions
• Combinatorial secretary problems with ordinal information

zbMATH Keywords

online admissionsecretary marketsthresholding-based algorithms

Mathematics Subject Classification ID

Labor markets (91B39)

Cites Work

• 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
• Matroid prophet inequalities
• Who solved the secretary problem
• Competitive weighted matching in transversal matroids
• Submodular secretary problem and extensions
• Title not available (Why is that?)
• 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
• Secretary Problems via Linear Programming
• Semiamarts and finite values
• An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
• Online independent set beyond the worst-case: secretaries, prophets, and periods
• Stable secretaries
• Secretary markets with local information
• Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
• Polymatroid Prophet Inequalities
• The submodular secretary problem goes linear
• Combinatorial secretary problems with ordinal information
• Effects of competition in a secretary problem
• Dueling algorithms

Cited In (5)

• Stable secretaries
• Secretary markets with local information
• The secretary recommendation problem
• Hiring secretaries over time: the benefit of concurrent employment
• Packing returning secretaries

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 Q2010597)