WohnFair: α-Fair, Cryptographically Auditable Housing Allocation
Fuente:
Zenodo
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Recurso digital |
| Langue: | anglais |
| Publié: |
Zenodo
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866902032601841664 |
|---|---|
| author | Siddiqui, Aqib Nadeem, Akhtar |
| author_facet | Siddiqui, Aqib Nadeem, Akhtar |
| contents | <p>Housing allocation is a canonical indivisible resource allocation problem with urgent relevance in Germany’s housing crisis. Existing mechanisms lotteries, point systems, first-come-first-served lack provable fairness guarantees, are vulnerable to manipulation, and fail to incorporate predictive risk models.</p> <p>This preprint introduces WohnFair, the first framework to unify:<br><br>1. FairRent Algorithm — extension of α-fair scheduling to indivisible housing allocation, with proofs of non-starvation, proportional fairness, and O(n log m) scalability.<br>2. ZK-Lease Protocol — a Halo2/PLONK-based zero-knowledge eligibility system providing Sybil resistance and O(1) verification.<br>3. FairSurvival-GAN — a fairness-constrained survival analysis model that improves concordance index from 0.70→0.85 and reduces group fairness gaps to <5%.</p> <p>Experiments on Berlin, Munich, and Hamburg housing datasets show:<br>- Waitlist clearance time ↓41%<br>- Fraudulent applications ↓93%<br>- Group fairness gap ↓22%</p> <p>Status: Preprint on Zenodo. All code, reproducibility pipelines, and Dockerized implementations available at: [https://github.com/Aqib121201/WohnFair-cryptographically-auditable-housing-allocation-system].</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_16975655 |
| institution | Zenodo |
| language | eng |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | WohnFair: α-Fair, Cryptographically Auditable Housing Allocation Siddiqui, Aqib Nadeem, Akhtar Fair allocation Artificial Intelligence Data Science Machine Learning Cryptography Zero-knowledge proofs Algorithmic fairness Resource scheduling Housing allocation Reproducibility <p>Housing allocation is a canonical indivisible resource allocation problem with urgent relevance in Germany’s housing crisis. Existing mechanisms lotteries, point systems, first-come-first-served lack provable fairness guarantees, are vulnerable to manipulation, and fail to incorporate predictive risk models.</p> <p>This preprint introduces WohnFair, the first framework to unify:<br><br>1. FairRent Algorithm — extension of α-fair scheduling to indivisible housing allocation, with proofs of non-starvation, proportional fairness, and O(n log m) scalability.<br>2. ZK-Lease Protocol — a Halo2/PLONK-based zero-knowledge eligibility system providing Sybil resistance and O(1) verification.<br>3. FairSurvival-GAN — a fairness-constrained survival analysis model that improves concordance index from 0.70→0.85 and reduces group fairness gaps to <5%.</p> <p>Experiments on Berlin, Munich, and Hamburg housing datasets show:<br>- Waitlist clearance time ↓41%<br>- Fraudulent applications ↓93%<br>- Group fairness gap ↓22%</p> <p>Status: Preprint on Zenodo. All code, reproducibility pipelines, and Dockerized implementations available at: [https://github.com/Aqib121201/WohnFair-cryptographically-auditable-housing-allocation-system].</p> |
| title | WohnFair: α-Fair, Cryptographically Auditable Housing Allocation |
| topic | Fair allocation Artificial Intelligence Data Science Machine Learning Cryptography Zero-knowledge proofs Algorithmic fairness Resource scheduling Housing allocation Reproducibility |
| url | https://doi.org/10.5281/zenodo.16975655 |