AI Paper Atlas

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

When Congestion Games Meet Mobile Crowdsourcing: Selective Information Disclosure

AAAI 2023 · Learning theory and algorithms › Submodular and game algorithms · approach: Matching markets and welfare · 9 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
Use myopic routing based on current expected latency rather than socially optimal explorationSelfish users in the congestion game · Parallel routing network, worst casePoA: PoA^(m)≥ 1/(1−ρ)Hurt
Hide all traffic informationInformation-hiding mechanism · Parallel routing network, worst casePoA: PoA^∅=∞Hurt
Selectively disclose expected path latencies when users would over-explore, and hide them otherwiseSelfish users in the congestion game · Parallel routing network, worst casePoA: PoA^(SID)≤ 1/(1−ρ/2)Helped
Use SID instead of myopic routingCongestion game · Simulation, N=2average inefficiency ratio: γ^(m)>10 to γ^(SID)<2Helped
Increase the number of risky pathsCongestion game under selfish routing · Simulation, varying risky path number Naverage inefficiency ratioHelped
Increase the high-hazard coefficient α_HCongestion game under selfish routing · Simulation, varying α_Haverage inefficiency ratioHelped

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