Privacy-Cost Cooperative Games and Prefix-Sampling Data Valuation: An Adult Benchmark Study

We formulate a cooperative data-sharing game with task utility, a stylized privacy cost and a coordination charge. Convexity and approximate core guarantees require explicit net-worth and error conditions. Ordered prefix sampling exposes individual marginals through public differences; the experiment evaluates a simulated interface. On one Adult split with 400 valuation and 600 evaluation records, a kNN recursion reportedly agrees with eight-record enumeration to 6.9e-16. At 128 permutations, simulated SecPSA has Spearman agreement 0.564 ± 0.036 with the recursion anchor, versus 0.572 ± 0.032 for Monte Carlo and 0.605 ± 0.017 for Data Banzhaf. Matched-permutation vectors reportedly agree exactly, with 6–16% simulated overhead. Privacy costs and institutional coalitions remain untested. Original utility definitions, code and seed-level outputs are required to audit the larger-pool anchor and statistical summaries.

Authors

Institutions

Publication Details

Journal
Systemic Analytics
Published
2026-11-17
DOI
https://doi.org/10.31181/sa44202698
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Privacy-Cost Cooperative Games and Prefix-Sampling Data Valuation: An Adult Benchmark Study

Şule Bayazit Bedirhanoğlu, Kwame A. Mensah
Systemic Analytics
Privacy-Preserving Technologies in Data
article

Privacy-Cost Cooperative Games and Prefix-Sampling Data Valuation: An Adult Benchmark Study

Şule Bayazit Bedirhanoğlu, Kwame A. Mensah
article en

Abstract

We formulate a cooperative data-sharing game with task utility, a stylized privacy cost and a coordination charge. Convexity and approximate core guarantees require explicit net-worth and error conditions. Ordered prefix sampling exposes individual marginals through public differences; the experiment evaluates a simulated interface. On one Adult split with 400 valuation and 600 evaluation records, a kNN recursion reportedly agrees with eight-record enumeration to 6.9e-16. At 128 permutations, simulated SecPSA has Spearman agreement 0.564 ± 0.036 with the recursion anchor, versus 0.572 ± 0.032 for Monte Carlo and 0.605 ± 0.017 for Data Banzhaf. Matched-permutation vectors reportedly agree exactly, with 6–16% simulated overhead. Privacy costs and institutional coalitions remain untested. Original utility definitions, code and seed-level outputs are required to audit the larger-pool anchor and statistical summaries.

Systemic AnalyticsVol. 4(4)
University of Cape Coast (GH), Bitlis Eren University (TR)
Privacy-Preserving Technologies in Data
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.

Laika access coming soon