atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

The Secretary Problem with Competing Employers on Random Edge Arrivals

AAAI 2022 · Learning theory and algorithms › Submodular and game algorithms · approach: Opponent modeling and subgame solving · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Allow thresholds to adapt to the number of players remainingCompeting employers in the edge-arrival secretary game · Adaptive edge-arrival game, k playersequilibrium thresholds: r∗k < r∗k−1 < · · · < r∗1 = 1/eHelped
Use a fixed threshold instead of updating it as players leaveTwo-player edge-arrival secretary game · Two-player gameequilibrium threshold: 0.29574 -> 0.29533...Mixed
Increase the number of players using a symmetric fixed-threshold strategyNon-adaptive edge-arrival secretary game · k-player gameequilibrium threshold: 1/k − 1/k2 < r∗(k) < 1/kHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy