We investigate the problem of allocating items (private goods) among competing agents in a setting that is both prior-free and paymentfree. Specifically, we focus on allocating mu...
We study the problem of allocating a single item repeatedly among multiple competing agents, in an environment where monetary transfers are not possible. We design (Bayes-Nash) inc...
Many important problems in multiagent systems involve the allocation of multiple resources among the agents. If agents are self-interested, they will lie about their valuations fo...