Research map / Multi-agent systems and games / Games and equilibria
Combinatorial Group Testing with Selfish Agents
Giorgos Chionas, Dariusz Rafal Kowalski, Piotr Krysta
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Move from classical CGT to the selfish-agent game with adversarial equilibrium, known k | Adaptive binary-search-with-shortcuts strategy · Combinatorial group testing, known k | maximum revealing time | Improved |
| Provide an upper bound k' >= 3 on k instead of exact k | Any AE strategy · Unknown k | maximum revealing time lower bound | No clear effect |
| Use adaptive deterministic AE strategies rather than non-adaptive ones | Selfish CGT · Known k, price of stability | price of stability | Improved |
Closest papers by meaning
- Online Learning of Coalition Structures by Selfish Agents (AAAI 2025 · similarity 0.85)
- Learning Coalition Structures with Games (AAAI 2024 · similarity 0.85)
- Deviate or Not: Learning Coalition Structures with Multiple-bit Observations in Games (AAAI 2025 · similarity 0.84)
- The Complexity of Two-Team Polymatrix Games with Independent Adversaries (ICLR 2025 · similarity 0.84)
- Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem (NeurIPS 2024 · similarity 0.84)
- DAG-Based Column Generation for Adversarial Team Games (ICML 2024 · similarity 0.84)
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.
