Pith. sign in

REVIEW 1 cited by

A Probabilistic Approach to Voting, Allocation, Matching, and Coalition Formation

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.10171 v1 pith:2NCGN7V2 submitted 2020-02-24 cs.GT

Haris Aziz This is my paper · ORCID
classification cs.GT
keywords allocationapplyingapproachescoalitionformationmatchingsettingsvoting
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Randomisation and time-sharing are some of the oldest methods to achieve fairness. I make a case that applying these approaches to social choice settings constitutes a powerful paradigm that deserves an extensive and thorough examination. I discuss challenges and opportunities in applying these approaches to settings including voting, allocation, matching, and coalition formation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Alternative Mixed Integer Linear Programming Optimization for Joint Job Scheduling and Data Allocation in Grid Computing

    cs.DC 2025-02 conditional novelty 4.0 of 10

    ALTERMILP alternately fixes job assignment and job order/data placement, solving each subproblem with a standard MILP solver, and outperforms baseline heuristics on simulated grids.

Pith tools