Sciweavers

1662 search results - page 41 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Multi-unit auctions with budget-constrained bidders
We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense ...
Christian Borgs, Jennifer T. Chayes, Nicole Immorl...
CLUSTER
2002
IEEE
14 years 17 days ago
Algorithmic Mechanism Design for Load Balancing in Distributed Systems
Computational Grids are large scale computing system composed of geographically distributed resources (computers, storage etc.) owned by self interested agents or organizations. T...
Daniel Grosu, Anthony T. Chronopoulos
DALT
2009
Springer
13 years 11 months ago
Computing Utility from Weighted Description Logic Preference Formulas
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...
BMCBI
2008
104views more  BMCBI 2008»
13 years 7 months ago
ReRep: Computational detection of repetitive sequences in genome survey sequences (GSS)
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
Thomas D. Otto, Leonardo H. F. Gomes, Marcelo Alve...
AAAI
2007
13 years 10 months ago
Allocating Goods on a Graph to Eliminate Envy
We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A gr...
Yann Chevaleyre, Ulrich Endriss, Nicolas Maudet