948 search results - page 21 / 190 » What can we achieve by arbitrary announcements |
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We investigate trust-based relationships in electronic supply chains where trust is a measure of consistency in meeting negotiated contract deadlines. We consider scenarios where ...
EOR
2007
13 years 7 months ago
2007
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
SIGECOM
2010
ACM
14 years 11 days ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
SIROCCO
2008
13 years 9 months ago
2008
We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between t...