atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Coalition Formation in Multi-defender Security Games

AAAI 2021 · Learning theory and algorithms › Submodular and game algorithms · approach: Opponent modeling and subgame solving · 7 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
Form the grand coalition and allocate defenders’ resources jointlyMulti-defender security games · Canonical games0+-core existenceHelped
Use Algorithm 1 to construct a grand-coalition strategyMulti-defender security games · Canonical gamescomputation timeHelped
Compute the entire 0+-core, excluding grand-coalition structuresMulti-defender security games · Two defenderscomputational complexityHurt
Check stability against a specified deviating coalition using the safety-demand algorithmCoalition structures · Multi-defender security gamescomputational complexityHelped
Bound the number of defender typesCoalition-structure stability checking · Games with λ defender typesruntime: O(2^λ poly(m, n))Helped

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