|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 5 van 27 gevonden artikelen
| Titel: |
Bilateral Ranking Negotiations |
| Auteur: |
Antoni Mazurkiewicz |
| Verschenen in: |
Fundamenta informaticae |
| Paginering: | Jaargang 60 (2004) nr. 1-4 pagina's 1-16 |
| Jaar: |
2004-09-10 |
| Inhoud: |
In general, a negotiation within a group of participants is a process, which starting with participants in some arbitrary (initial) states eventually come to an agreement with all participants being in the negotiated state. The formal method used for discussing the considered issue are local computations; in general, they consist in transforming states of whole structures by way of transforming states of some of their substructures. Negotiation procedures are local computations that act according to negotiation protocols. The paper aims to discuss communication structures that admit negotiations limited to direct communications between at most two negotiating partners (bilateral negotiations). As a formal model of the communication structures graphs are used, with nodes representing participants of negotiations, edges the direct links between them, and a total (linear) ordering of nodes as the goal of negotiations; in our setup substructures subjected to transformations consist of two adjecent nodes only. There are known protocols that can solve particular problems; the question arises whether the same problems can be solved by local computations using substructures of size at most two. The present paper aims to offer an answer to this question. |
| Uitgever: |
IOS Press |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 5 van 27 gevonden artikelen
| << vorige | volgende >> |