80 search results - page 5 / 16 » On decentralized incentive compatible mechanisms |
SIGECOM
2000
ACM
14 years 1 days ago
2000
ACM
This paper studies auctions in a setting where the di erent bidders arrive at di erent times and the auction mechanism is required to make decisions about each bid as it is receiv...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
SIGECOM
2003
ACM
14 years 28 days ago
2003
ACM
We consider the problem of designing mechanisms for online problems in which agents arrive over time and the mechanism is unaware of the agent until the agent announces her arriva...
GLOBECOM
2009
IEEE
13 years 11 months ago
2009
IEEE
We consider a problem where two selfish cognitive radio users try to share two channels on which they each have potentially different valuations. We first formulate the problem as ...
PODC
2004
ACM
14 years 1 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...