SIGECOM
2003
ACM
13 years 9 months ago
2003
ACM
SIGECOM
2003
ACM
13 years 9 months ago
2003
ACM
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
SIGECOM
2003
ACM
13 years 9 months ago
2003
ACM
This paper discusses an interested party who wishes to influence the behavior of agents in a game (multi-agent interaction), which is not under his control. The interested party ...
SIGECOM
2003
ACM
13 years 9 months ago
2003
ACM
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
SIGECOM
2003
ACM
13 years 9 months ago
2003
ACM
Peer-to-Peer eCommerce communities are commonly perceived as an environment offering both opportunities and threats. One way to minimize threats in such an open community is to us...
SIGECOM
2003
ACM
13 years 9 months ago
2003
ACM
A market-based scheduling mechanism allocates resources indexed by time to alternative uses based on the bids of participating agents. Agents are typically interested in multiple ...
SIGECOM
2003
ACM
13 years 9 months ago
2003
ACM
SIGECOM
2003
ACM
13 years 9 months ago
2003
ACM
SIGECOM
2003
ACM
13 years 9 months ago
2003
ACM
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as qualit...
SIGECOM
2003
ACM
13 years 9 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...