The Matching Problem: Exact Probabilities and An Elementary Proof of the Poisson Approximation Rate

Exact solution to the matching (hat-check) problem via inclusion-exclusion; gives an elementary proof of the 2N/N! Poisson approximation rate, with a new pointwise bound verified numerically.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-14
DOI
https://doi.org/10.5281/zenodo.22749252
Primary Topic
Optimization and Search Problems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

The Matching Problem: Exact Probabilities and An Elementary Proof of the Poisson Approximation Rate

Amirhossein MoradiSizkouhi
Zenodo (CERN European Organization for Nuclear Research)
Optimization and Search Problems
preprint

The Matching Problem: Exact Probabilities and An Elementary Proof of the Poisson Approximation Rate

Amirhossein MoradiSizkouhi
preprint en

Abstract

Exact solution to the matching (hat-check) problem via inclusion-exclusion; gives an elementary proof of the 2N/N! Poisson approximation rate, with a new pointwise bound verified numerically.

Zenodo (CERN European Organization for Nuclear Research)
Imam Khomeini International University (IR)
Reduced inequalities
Optimization and Search Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The Matching Problem: Exact Probabilities and An Elementary Proof of the Poisson Approximation Rate — Amirhossein MoradiSizkouhi · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS