Login / Signup

Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation Guarantees.

Frederick V. QiuS. Matthew Weinberg
Published in: STOC (2024)
Keyphrases
  • mechanism design
  • approximation guarantees
  • approximation algorithms
  • computational complexity
  • multiagent systems
  • greedy algorithm
  • strategy proof
  • worst case
  • np complete
  • incentive compatible
  • np hard