220 search results - page 33 / 44 » Combinatorial auctions with externalities |
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
ICPP
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Resource sharing on the Internet is becoming increasingly pervasive. Recently, there is growing interest in distributed systems such as peer-to-peer and grid, with effor...
JAIR
2006
14 years 10 months ago
2006
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
119
click to vote
STOC
2012
ACM
13 years 16 days ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
SAGT
2009
Springer
15 years 4 months ago
2009
Springer
Roberts’ theorem from 1979 states that the only incentive compatible mechanisms over a full domain and range of at least 3 are weighted variants of the VCG mechanism termed affin...