39 search results - page 5 / 8 » Reaching Envy-Free States in Distributed Negotiation Setting... |
SBMF
2009
Springer
14 years 2 days ago
2009
Springer
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
WOWMOM
2005
ACM
14 years 1 months ago
2005
ACM
Distributed trust and reputation management mechanisms are often proposed as a means of providing assurance in dynamic and open environments by enabling principals to building up ...
CIA
2006
Springer
13 years 11 months ago
2006
Springer
We present a mechanism for collaboration and coordination amongst agents in multi-agent societies seeking social equity. This mechanism allows to compute egalitarian allocations of...
GRID
2008
Springer
13 years 7 months ago
2008
Springer
Traditional resource management techniques (resource allocation, admission control and scheduling) have been found to be inadequate for many shared Grid and distributed systems th...
CONCUR
2001
Springer
14 years 1 days ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...