We are excited to announce that the repository will soon undergo an upgrade, featuring a new look and feel along with several enhanced features to improve your experience. Please be on the lookout for further updates and announcements regarding the launch date. We appreciate your support and look forward to unveiling the improved platform soon.
dc.contributor.advisor | Timm, Nils | |
dc.contributor.coadvisor | Goranko, Valentin | |
dc.contributor.postgraduate | Van Rooyen, Johan Pieter | |
dc.date.accessioned | 2023-12-01T05:51:55Z | |
dc.date.available | 2023-12-01T05:51:55Z | |
dc.date.created | 2024-04-01 | |
dc.date.issued | 2023 | |
dc.description | Dissertation (MSc (Computer Science))--University of Pretoria, 2023. | en_US |
dc.description.abstract | The Generalised Dining Philosophers Game (GDPG) consists of agents which must cooperate (or compete) for shared resources. As there are several cooperating agents, we can think of the GDPG as a multi-agent system. In such a system, there are naturally some qualitative objectives such as fairness and liveness; and quantitative objectives where the agents seek to satisfy their goal as frequently as possible. The GDPG is represented as a concurrent game model and the agents’ objectives are represented by LTL[F] formulas. There are some qualitative objectives which represent the goals of the entire group, and some quantitative objectives which represent the individual agents’ and should be optimised. From this point, the LTL[F] model checking procedure is modified to produce an automaton-based algorithm which identifies a strategy profile which satisfies the qualitative objectives, and also is a Nash Equilibrium with respect to the agent’s quantitative objectives. That is, at each configuration of the game, an action must be prescribed to each agent such that the collective objectives of the group are satisfied, and no agent can unilaterally deviate in order to achieve a better outcome. | en_US |
dc.description.availability | Unrestricted | en_US |
dc.description.degree | MSc (Computer Science) | en_US |
dc.description.department | Computer Science | en_US |
dc.description.faculty | Faculty of Engineering, Built Environment and Information Technology | en_US |
dc.identifier.citation | * | en_US |
dc.identifier.other | A2024 | en_US |
dc.identifier.uri | http://hdl.handle.net/2263/93578 | |
dc.language.iso | en | en_US |
dc.publisher | University of Pretoria | |
dc.rights | © 2023 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. | |
dc.subject | Multi-agent Systems | en_US |
dc.subject | Automata Theory | en_US |
dc.subject | Nash Equilibrium | en_US |
dc.subject | Rational Synthesis | en_US |
dc.subject | Dining Philosophers Problem | en_US |
dc.subject | UCTD | en_US |
dc.title | Nash equilibria in generalised dining philosophers games | en_US |
dc.type | Dissertation | en_US |