FIT Scholar
Archive

Category: Prior Research

  • Applications of game theory in deep learning: a survey

    Applications of game theory in deep learning: a survey

    Tanmoy Hazra 1 & Kushal Anjaria2
    Received: 9 June 2021 / Revised: 29 August 2021 / Accepted: 3 January 2022

    The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022

    Abstract


    This paper provides a comprehensive overview of the applications of game theory in deep learning. Today, deep learning is a fast-evolving area for research in the domain of artificial intelligence. Alternatively, game theory has been showing its multi-dimensional applications in the last few decades. The application of game theory to deep learning includes another dimension in research. Game theory helps to model or solve various deep learning-based problems. Existing research contributions demonstrate that game theory is a potential approach to improve results in deep learning models. The design of deep learning models often involves a game-theoretic approach. Most of the classification problems which popularly employ a deep learning approach can be seen as a Stackelberg game. Generative Adversarial Network (GAN) is a deep learning architecture that has gained popularity in solving complex computer vision problems. GANs have their roots in game theory. The training of the generators and discriminators in GANs is essentially a two-player zero-sum game that allows the model to learn complex functions. This paper will give researchers an extensive account of significant contributions which have taken place in deep learning using game-theoretic concepts thus, giving a clear insight, challenges, and future directions. The current study also details various real-time applications of existing literature, valuable datasets in the field, and the popularity of this research area in recent years of publications and citations.

  • A hybrid genetic algorithm for scheduling jobssharing multiple resources under uncertainty

    A hybrid genetic algorithm for scheduling jobssharing multiple resources under uncertainty

    Hanyu Gu, Hue Chi Lam , Yakov Zinder
    School of Mathematical and Physical Sciences, University of Technology Sydney,
    PO Box 123, Broadway, NSW 2007, Australia

    Abstract

    This study addresses the scheduling problem where every job requires several types of resources. At every point in time, the capacity of resources is limited. When necessary, the capacity can be increased at a cost. Each job has a due date, and the processing times of jobs are random variables with a known probability distribution. The considered problem is to determine a schedule that minimises the total cost, which consists of the cost incurred due to the violation of resource limits and the total tardiness of jobs. A genetic algorithm enhanced by local search is proposed. The sample average approximation method is used to construct a confidence interval for the optimality gap of the obtained solutions. Computational study on the application of the sample average approximation method and genetic algorithm is presented. It is revealed that the proposed method is capable of providing high-quality solutions to large instances in a reasonable time.

  • Unique Stable Matching Q1

    Unique Stable Matching Q1

    Gregory Z. Gutin a, Philip R. Neary b,∗ , Anders Yeo c,d

    • a Computer Science Department, Royal Holloway University of London, United Kingdom
    • b Economics Department, Royal Holloway University of London, United Kingdom
    • c IMADA, University of Southern Denmark, Denmark
    • d Department of Mathematics, University of Johannesburg, South Afric

  • Problem of Gale Shapley

    Problem of Gale Shapley

    Last time we encountered the stable marriage problem for the first time: given a set of n “men” and n “women” (where each one has a preference ranking of all the others), is it always possible to specify a matching between the two sides such that every man is paired to exactly one woman, and the matching is stable (in the formal sense defined last lecture)? Initially, we studied the stable roommates problem and found that in that related problem, stable matchings are not guaranteed to exist. Must that negative result carry over to the stable marriage problem? As it turns out, it does not. To understand why and to answer many of our fundamental questions about the stable marriage problem, we turn now to one of the great algorithms of the 20th century.