In this paper, we address the problem of convergence to Nash equilibria in games with rewards that are initially unknown and which must be estimated over time from noisy observations. These games arise in many real-world applications, whenever rewards for actions cannot be prespecified and must...

Vickrey-Clarke-Groves (VCG) mechanisms are often used to allocate tasks to selfish and rational agents. VCG mechanisms are incentive-compatible, direct mechanisms that are efficient (i.e. maximise social utility) and individually rational (i.e. agents prefer to join rather than opt out)....

We analyse assignment problems in which not every agent is controlled by the central planner. The autonomous agents search for vacant tasks guided by their own preference orders over available tasks. The goal of the central planner is to maximise the total value of the assignment, taking into...

We study the problem of allocating m identical items among n m agents with unit demand and private value for consuming the good. We allow payments and focus on dominant{strategy implementation. In the absence of an auctioneer who can absorb payments collected from the agents, the payments must...

We study the problem of allocating m identical items among nm agents with unit demand and private value for consuming the good. We allow payments and focus on dominant-strategy implementation. In the absence of an auctioneer who can absorb payments collected from the agents, the payments must be...