AI Paper Atlas

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

Pareto Optimal Allocation under Compact Uncertain Preferences

Haris Aziz, Peter Biro, Ronald de Haan, Baharak Rastegari

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 the joint probability representation rather than independent lotteriesComputing PO probability for an assignment · PO-Probabilitycomputational complexity: #P-complete -> in PImproved
Restrict the number of uncertain agents to a constantLottery model PO-Probability · PO-Probabilitycomputational complexity: #P-complete -> polynomial-time solvableImproved
Parameterize PO-probability computation by the number of uncertain agentsLottery model PO-Probability · PO-Probabilityparameterized complexity: fixed-parameter tractableImproved
Check whether the assignment has non-zero PO probabilityLottery model · IsPO-ProbabilityNon-Zerocomputational complexity: in PImproved
Check whether the assignment has PO probability oneIndependent uncertainty models · IsPO-ProbabilityOnecomputational complexity: linear timeImproved

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