A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
We study the degree to which small fluctuations in costs in wellstudied potential games can impact the result of natural best-response and improved-response dynamics. We call thi...