Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Nash equilibria in generalised dining philosophers games

Dissertation (MSc (Computer Science))--University of Pretoria, 2023.

Saved in:
Bibliographic Details
Other Authors: Timm, Nils
Format: Thesis
Language:English
Published: University of Pretoria 2023
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1867613496649187328
access_status_str Open Access
author2 Timm, Nils
author_browse Timm, Nils
author_facet Timm, Nils
collection Thesis
dc_rights_str_mv © 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.
description Dissertation (MSc (Computer Science))--University of Pretoria, 2023.
format Thesis
id oai:repository.up.ac.za:2263/93578
institution University of Pretoria (South Africa)
language English
last_indexed 2026-06-10T12:37:04.556Z
license_str Other — see source repository
provenance_str_mv Harvested via OAI-PMH from UPSpace — University of Pretoria Institutional Repository
publishDate 2023
publishDateRange 2023
publishDateSort 2023
publisher University of Pretoria
publisherStr University of Pretoria
record_format dspace
source_str UPSpace — University of Pretoria Institutional Repository
spelling oai:repository.up.ac.za:2263/93578 Nash equilibria in generalised dining philosophers games Timm, Nils johan-vr1@hotmail.com Goranko, Valentin Van Rooyen, Johan Pieter Multi-agent Systems Automata Theory Nash Equilibrium Rational Synthesis Dining Philosophers Problem UCTD Dissertation (MSc (Computer Science))--University of Pretoria, 2023. 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. Computer Science MSc (Computer Science) Unrestricted Faculty of Engineering, Built Environment and Information Technology 2023-12-01T05:51:55Z 2023-12-01T05:51:55Z 2024-04-01 2023 Dissertation * A2024 http://hdl.handle.net/2263/93578 en © 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. application/pdf University of Pretoria
spellingShingle Multi-agent Systems
Automata Theory
Nash Equilibrium
Rational Synthesis
Dining Philosophers Problem
UCTD
Nash equilibria in generalised dining philosophers games
title Nash equilibria in generalised dining philosophers games
title_full Nash equilibria in generalised dining philosophers games
title_fullStr Nash equilibria in generalised dining philosophers games
title_full_unstemmed Nash equilibria in generalised dining philosophers games
title_short Nash equilibria in generalised dining philosophers games
title_sort nash equilibria in generalised dining philosophers games
topic Multi-agent Systems
Automata Theory
Nash Equilibrium
Rational Synthesis
Dining Philosophers Problem
UCTD
url http://hdl.handle.net/2263/93578