577 search results - page 35 / 116 » Budget Feasible Mechanisms |
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
ATAL
2010
Springer
15 years 28 days ago
2010
Springer
We study a more powerful variant of false-name manipulation in Internet auctions: an agent can submit multiple false-name bids, but then, once the allocation and payments have bee...
106
click to vote
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
— This paper is concerned with the problem of identifying robust equilibrium postures of a planar mechanism supported by fixed frictional contacts in a twodimensional gravitation...
JSAC
2008
14 years 11 months ago
2008
We consider a wireless collision channel, shared by a finite number of users who transmit to a common base station. Each user wishes to minimize its average transmission rate (or p...
111
click to vote
SASO
2007
IEEE
15 years 6 months ago
2007
IEEE
For self-organising emergent solutions, there is no support to explicitly design system-wide information flows and feedback loops in those flows. This is problematic because the...