AI Paper Atlas

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

Average-Case Approximation Ratio of Scheduling Without Payments

Jie Zhang

AAAI 2018 · Learning theory and algorithms › Submodular and game algorithms · approach: Matching markets and welfare · 3 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
Analyze Mechanism M under i.i.d. machine costs rather than only by its worst-case ratioMechanism M · Single-task scheduling; any i.i.d. distribution on [t_min, +infty)average-case approximation ratio: < 2 h + 1.33; worst-case ratio: \frac{n+1}{2}Improved
Apply the general bound to a Pareto cost distributionMechanism M · Single-task scheduling; Pareto distributionaverage-case approximation ratio: 2 \cdot 12^{\frac{1}{\alpha}} + 1.33Improved
Apply the general bound to a truncated Exponential cost distributionMechanism M · Single-task scheduling; truncated Exponential distributionaverage-case approximation ratio: 2 \cdot \frac{1}{\lambda t_{\min}} \ln 12 + 1.33Improved
Apply the general bound to a Log-logistic cost distributionMechanism M · Single-task scheduling; Log-logistic distributionaverage-case approximation ratio: 2 \cdot \frac{1}{t_{\min}} \cdot e^{\frac{\ln 11}{\beta}} + 1.33Improved

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