AI Paper Atlas

Research map / Multi-agent systems and games / Games and equilibria

Fair and Efficient Memory Sharing: Confronting Free Riders

Eric J. Friedman, Vasilis Gkatzelis, Christos-Alexandros Psomas, Scott Shenker

AAAI 2019 · Multi-agent systems and games › Games and equilibria · approach: Fair division and coalition formation

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
Use nonuniform blocking instead of uniform blocking in the two-agent mechanismBuy-In mechanism (two agents) · Two-agent memory sharing, theoretical guaranteePareto approximation factor: 50% -> 83%Improved
Use nonuniform blocking instead of uniform blocking with many agentsOpt-Out mechanism (n agents) · n-agent memory sharing, theoretical guaranteePareto approximation factor: no constant -> 63%Improved
Allow nonuniform blocking while requiring proportionality and truthfulness (upper limit)Any proportional truthful nonuniform-blocking mechanism · Two-agent memory sharing, impossibility boundPareto approximation factor: 83% achieved vs 91% impossibleHurt

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