Mullat, Joseph E. (2016): The Dilemma Facing Guests Enjoying a Party.
Preview |
PDF
MPRA_paper_70785.pdf Download (193kB) | Preview |
Abstract
A partially ordered set formalizes and generalizes the intuitive notion of ordering, sequencing, or arrangement of the elements in the set. In the present paper under Monotone (or Monotonic) System we understand a totality of sets of guests charity positions arranging guests utilities possessing monotone (monotonic) property, which reflects the dynamic nature of utilities. Utilities are increasing or decreasing along with the partial order induced by subsets of some general set. The theory produces Greedy type algorithms, which guarantee the optimal solution.
Item Type: | MPRA Paper |
---|---|
Original Title: | The Dilemma Facing Guests Enjoying a Party |
Language: | English |
Keywords: | Game, Monotone, Greedy, System, Ordering |
Subjects: | C - Mathematical and Quantitative Methods > C6 - Mathematical Methods ; Programming Models ; Mathematical and Simulation Modeling > C61 - Optimization Techniques ; Programming Models ; Dynamic Analysis C - Mathematical and Quantitative Methods > C7 - Game Theory and Bargaining Theory > C71 - Cooperative Games |
Item ID: | 70785 |
Depositing User: | Joseph E. Mullat |
Date Deposited: | 19 Apr 2016 03:00 |
Last Modified: | 01 Oct 2019 04:06 |
References: | 1. Joseph E. Mullat, a) On a maximum principle for certain functions of sets, in: Notes on Data Processing and Functional Analysis, Proceedings of the Tallinn Polytechnic Institute (in Russian), Series A, 1971, No. 313, pp. 37-44; b) Extremal subsystems of monotonic systems I, 1976, Avt. Tel., No.5, pp. 130 –139. 2. Leo Võhandu, R. Kuusk, A. Torim, E. Aab and G. Lind, Some algorithms for data table (re)ordering using Monotone Systems, Department of Informatics, Tallinn University of Technology, Proceedings of the 5th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases, Madrid, Spain, 2006, February 15-17, pp. 417-422. 3. Yulia Kempner and Vadim E. Levit, Correspondence between two antimatroid algorithmic characterizations, Department of Computer Science, Holon Academic Institute of Technology, 52 Golomb Str., P.O. Box 305, july 2003, Holon 58102, ISRAEL. 4. Babin A.I. and Shorin O.A., An Algorithm of Frequency-Territorial Cover for Department Systems of Land-Mobile Radio Communications, Russian Academy of Sciences, ”Успехи Современного Естествознания,” 2008, No.4. 5. Alexsandr V. Genkin (Moscow), Ilya B. Muchnik (Boston), Fixed Approach to Clustering, Journal of Classification, Springer, 1993, 10, pp. 219-240. 6. Boris G. Mirkin and Ilya Muchnik, Layered Clusters of Tightness Set Functions, Applied Mathematics Letters, 2002, v. 15, issue no. 2, pp. 147-151. 7. Anton Mgeladze and Gociridze G., Cluster Analysis in the Study of Organizational Systems, Georgian Technical University, Tbilisi, 2009, ISBN 978-9941-551-3, p.248, in Russian. |
URI: | https://mpra.ub.uni-muenchen.de/id/eprint/70785 |