Sciweavers

33 search results - page 4 / 7
» Truthful Mechanisms for Generalized Utilitarian Problems
Sort
View
SIGECOM
2005
ACM
169views ECommerce» more  SIGECOM 2005»
14 years 29 days ago
Online auctions with re-usable goods
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...
APSEC
2007
IEEE
14 years 1 months ago
Incentive Compatible Mechanisms for Group Ticket Allocation in Software Maintenance Services
A customer reported problem (or Trouble Ticket) in software maintenance is typically solved by one or more maintenance engineers. The decision of allocating the ticket to one or m...
Karthik Subbian, Ramakrishnan Kannan, Raghav Kumar...
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
14 years 20 days ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
ATAL
2006
Springer
13 years 11 months ago
Failures of the VCG mechanism in combinatorial auctions and exchanges
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
Vincent Conitzer, Tuomas Sandholm
ATAL
2008
Springer
13 years 9 months ago
Distributed multiagent resource allocation in diminishing marginal return domains
We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sh...
Yoram Bachrach, Jeffrey S. Rosenschein