Sciweavers

1068 search results - page 77 / 214
» Group Dominant Strategies
Sort
View
AAAI
2004
15 years 7 months ago
GROWRANGE: Anytime VCG-Based Mechanisms
We introduce anytime mechanisms for distributed optimization with self-interested agents. Anytime mechanisms retain good incentive properties even when interrupted before the opti...
David C. Parkes, Grant Schoenebeck
CORR
2007
Springer
81views Education» more  CORR 2007»
15 years 6 months ago
Throughput Scaling Laws for Wireless Networks with Fading Channels
—A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels b...
Masoud Ebrahimi, Mohammad Ali Maddah-Ali, Amir K. ...
HPCC
2005
Springer
15 years 11 months ago
On Algorithm for the Delay- and Delay Variation-Bounded Multicast Trees Based on Estimation
With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to op...
Youngjin Ahn, Moonseong Kim, Young-Cheol Bang, Hyu...
DEXA
2007
Springer
140views Database» more  DEXA 2007»
16 years 10 days ago
Clustering-Based K-Anonymisation Algorithms
Abstract. K-anonymisation is an approach to protecting private information contained within a dataset. Many k-anonymisation methods have been proposed recently and one class of suc...
Grigorios Loukides, Jianhua Shao
ICMAS
1998
15 years 7 months ago
How Much Should an Agent Know what Other Agents are Doing in a Cooperative Team?
Cooperation ina task oriented multi-agent team is important because a well designed cooperation strategy among a group of cooperating agents can lead to an increase of the group p...
Yiming Ye