AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

On Covering Codes and Upper Bounds for the Dimension of Simple Games

Martin Olsen

AAAI 2017 · Learning theory and algorithms › Sample complexity · approach: Computational thresholds in graphs and structure · 0 citations (OpenAlex)

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
Cover the maximal losing coalitions with a radius-1 binary covering code and represent each covered group by a weighted gameSimple games with n players · Simple games with n playersdimension upper bound: d_n ≤ K_nImproved
Pair maximal losing coalitions at distance at most 3, handling unpaired coalitions as singletonsSimple games · Simple games with maximal losing coalitionsdimension upper bound: \frac{1}{2}(|L^M|+|C|)Improved
Use a covering code to bound dimension rather than the Taylor-Zwicker maximal-losing-coalition boundMaximum dimension d_n · Simple games with n playersdimension upper bound: d_n ≤ K_nImproved

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