Sciweavers

2983 search results - page 397 / 597
» The group marriage problem
Sort
View
SIGECOM
2004
ACM
112views ECommerce» more  SIGECOM 2004»
14 years 2 months ago
Self-interested automated mechanism design and implications for optimal combinatorial auctions
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
Vincent Conitzer, Tuomas Sandholm
ICPP
2003
IEEE
14 years 2 months ago
Quorum-Based Asynchronous Power-Saving Protocols for IEEE 802.11 Ad Hoc Networks
This paper investigates the power mode management problem for an IEEE 802.11-based mobile ad hoc network (MANET) that allows mobile hosts to tune to the power-saving (PS) mode. The...
Jehn-Ruey Jiang, Yu-Chee Tseng, Chih-Shun Hsu, Ten...
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
14 years 2 months ago
Complexity of determining nonemptiness of the core
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
EUROCRYPT
1999
Springer
14 years 1 months ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier
ATAL
2006
Springer
14 years 29 days ago
Resource allocation among agents with preferences induced by factored MDPs
Distributing scarce resources among agents in a way that maximizes the social welfare of the group is a computationally hard problem when the value of a resource bundle is not lin...
Dmitri A. Dolgov, Edmund H. Durfee