Abstract
Having a group of ranking lists (ordered sequences) we can use different theories to research a scale of consistency according to the assessments contained in it. The agreement of ordered (queued) objects can be estimated as the maximal length of preference subsequences i.e. a maximal set of objects with the same queue of dominance relation. It is not important that among the chosen objects others exist but it is important that the i-th object is before j-th objects (has greater preference). The proposed sequence automata can be used to find different kinds of sequence agreements or disagreement among a sequenced group represented by for example by a ranking list. An exploitation ranking list has an essential advantage over other methods of object judgment (assessments) because different criteria or their sets are reduced only to positions on lists. In such a situation the problem of assessing the scale of consistency (agreement among authors or algorithms of ranking lists) remains. A unified-form of complex criteria presentation helps us to elaborate the tools for consistency estimation. We expect that sequence automata will resolve this and similar problems connected with sequence analysis. Our proposition is the tool supporting multi-agents system in areas of negotiation, partner recognition, creation hierarchy of criteria, planning strategy and finding hidden, imperceptible nuances (details), having dependence (or preference) character. It can be also used for coding and decoding information by sequence interlacement.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahuja, R., Magnanti, T., Orlin, J.B.: Network Flows. Prencice-Hall, Englewood Clifs (1993)
Baker, K.R., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constrains, TR 8028/0, Econometric Institute, Erasmus University, Rotterdam (1980)
Baker, K.R., Schrage, L.E.: Finding an optimal sequence by dynamic programming: An extension to precedence-related tasks. Oper. Res. 26, 111–120 (1978)
Ballas, E.: Machine sequencing via disjunctive graphs: An implicit enumeration algorithm. Oper. Res. 17, 941–957 (1969)
Bennington, G.E., Mc Ginnis, L.F.: A critique of project planning with constrained resources. Elmaghraby, 1–28 (1973)
Blazewicz, J., Lenstra, J.K., Rinnooy Kan, A.H.G.: Scheduling subject to resource constrains: Classification and complexity. Discrete Appl. Math. 5, 11–24 (1983)
Cheriton, D., Tarian, R.E.: Finding minimum spanning trees. SIAM J. Comput. 5, 724–742 (1976)
Coffman, E.G., Graham, R.L.: Optimal scheduling for processor system. Acta Inform. 1, 200–213 (1972)
Denardo, E.V., Fox, B.L.: Shortest - route methods: 1. Reaching, purring and buckeds. Oper. Res. 27, 215–248 (1979)
Derigs, U., Heske, A.: A computational study on some methods for solving the cardinality matching problem. Angew. Inform Jg. 22, 249–254 (1980)
Fredman, M.L.: New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5, 83–89 (1976)
Gabow, H.: An efficient implementation of Edmond’s algorithm for maximum matching on graphs. J. AMC 23, 221–234 (1975)
Hu, T.C.: Parallel sequencing and assembly line problems. Oper. Res. 9, 841–848 (1961)
Jackson, J.R.: An extension of Johnson’s results on job lot scheduling. Naval Res. Logist. Quart. 3, 201–203 (1956)
Jackson, J.R.: Scheduling a production line to minimize maximum tardiness, RR 43, Management Science Research Project, University of California, Los Angeles (1955)
Keeney, R., Raiffa, H.: Decision with Multiple Objectives: Preferences and value Tradeoffs. John Wiley and Sons, NewYork (1976)
Kerschenbaum, A., Van Slyke, R.: Computing minimum spanning trees efficiently. In: Proc. 25th, Ann. Conf. of the ACM, pp. 518–527 (1972)
Lawler, E.L., Lenstra, J.K., Rinooy Kan, A.G.H., Shmoys, D.: The Traveling Salesmam Problem. Wiley, New York (1985)
McNaughton, R.: Scheduling with deadlines and loss functions. Management Sci. 6, 1–12 (1959)
Neuman von, J.: Theory of Self - Reproducing Automata. University of Illinois Press (1966)
Piech, H., Ptak, A.: Use of a fuzzy strategy to create the shortest Hamiltonian cycle. In: Intern.Conf. on Fuzzy Sets and Soft Comp. in Economics and Finance, pp. 299–307 (2004)
Piech, H.: Scheduling with applying rough sets theory. Czestochowa University of technology, Monographs 149 (2008)
Rinnoy Kan, A.H.G., Lageweg, B.J., Lenstra, J.K.: Minimizing total cost in one machine scheduling. Oper. Res. 23, 908–927 (1975)
Robertson, T., Wright, F.T., Dykstra, R.L.: Order restricted Statistical Inference. John Wiley and Sons, NewYork (1998)
Roy, B.: Multicriteria Methodology for decision Aiding. Kluwer Academic Publishers, Dordrecht (1996)
Sahni, S.: Algorithms for scheduling independent tasks. J. ACM 23, 116–127 (1976)
Sedeno-Noda, A., Gonzales Martin, C.: An Algorithm for the Biobjective Integer Minimum Cost Flow Problem. Computers and Operation Research 28(2), 139–156 (2001)
Sethi, R.: Scheduling graphs on two processors. SIAM J. Comput. 5, 73–82 (1976)
Shi, Z., Dongarra, J.J.: Scheduling workflow applications on processors with different capabilitie. Future Generation Computer Systems 22(6), 665–675 (2006)
Sidney, J.B.: An extension of Moore’s due date algorithm. Elmagraby, 393–398 (1973)
Smith, W.E.: Various optimizers for single-stage production. Naval Res. Logist. Quart. 3, 59–66 (1956)
Srinivasan, V., Shocker, A.D.: Estimating the weights for multiple attributes in a composite criterion using pairwise judgments. Psychometrica 38(4), 473–493 (1973)
Syslo, M.M., Deo, N., Kowalik, J.S.: Algorytmy optymalizacji dyskretnej. PWN, Warszawa (1995)
Syslo, M.M.: Optimal constructions of event-node networks. RAIRO Rech. Oper. 15, 241–260 (1981)
Van Vliet, D.: Improved shortest path algorithm for transportation networks. Transportation Res. 12, 7–20 (1978)
Yang, X., Yang, J., Wu, C., Yu, D.: Dominance - based rough set approach and knowledge reductions in incomplete ordered information system. Information Sciences 178(4), 1219–1234 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Piech, H. (2012). Sequence Automata for Researching Consensus Levels. In: Nguyen, NT. (eds) Transactions on Computational Collective Intelligence VIII. Lecture Notes in Computer Science, vol 7430. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34645-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-34645-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34644-6
Online ISBN: 978-3-642-34645-3
eBook Packages: Computer ScienceComputer Science (R0)