14 search results - page 2 / 3 » Mechanism Design for Set Cover Games When Elements Are Agent... |
SIGECOM
2003
ACM
13 years 11 months ago
2003
ACM
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
WINE
2007
Springer
13 years 12 months ago
2007
Springer
We study the problem of hiring a team of selfish agents to perform a task. Each agent is assumed to own one or more elements of a set system, and the auctioneer is trying to purch...
SIGECOM
2004
ACM
13 years 11 months ago
2004
ACM
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
The design of deterministic and fair mechanisms for selection among a set of self-motivated agents based solely on these agents' input is a major challenge in multiagent syst...
SODA
2007
ACM
13 years 7 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...