The DOI matches its Crossref record.
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Open accessAbstract
2with the case in which a single serial processor is to execute a sequence of instructions, in order to evaluate a desired result (value).In decentralized computation , the same goal is achieved by a set of processors operating in parali« and exchanging partial results.Parallel computation is advantageous in many situations, because the desired final result may be evaluated much faster, or becai the input data of the computation are physically distributed (for example, if the computation consists of statistical processing of data acquired by physically disti sensors).Interesting problems arise in this context because good parallel algorit can be very different from simple adaptations of good serial algorithms.Concerning decision making problems, especially in human organizations, it is often the case that distinct decision makers have different objectives, which are also different from the objective of the organization.This may lead to conflict i to situations best addressed by game theory.We will restrict, however, to situati in which: a) There is a well-defined organizational objective.b) The individual decision makers are either physical processors (so that no interest may be ascribed to them) or they may be treated -for the purpose of analysis -as if they were processors with predictable behavior.For example, a human decision maker may make decisions motivated by his perceived selfinterest; however, if an analyst knows the perceived self-interest of that decision maker, he may be able to predict his behavior.From that point on, ^elf-interests become irrelevant: as far as analysis is concerned, the human decision maker may be modelled as a processor, operating in a specific way.*In this context, the terms "parallel" or "distributed" computation are often usedSince S is an "easily computable" set as a function of its arguments, we can see that the centralized counterpart of DS is a trivial problem.So, any difficulty inherent in DS is only caused by the fact that information is decentralized• * Throughout this Chapter an overbar stands for negation.Also, Λ stands for logical "and" and V stands for logical "or".
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
Distributed event-triggered control for multi-agent systems
Dimarogonas, D. V., Frazzoli, E., & Johansson, K. H. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2174666 · Cited by 2,556
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439
Metadata
- Authors
- Τσιτσικλής, Ι.
- Publisher
- National Documentation Centre (EKT)
- Published
- 1984-01-01
- OpenAlex
- W1547358136
- Cited by
- 1,278
- References
- 0
- Type
- dissertation
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION. https://app.cochat.ai/papers/10.12681/eadd/3778
- The paper
- Τσιτσικλής, Ι. (2014). PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION. https://doi.org/10.12681/eadd/3778
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.