Game Theory and Operations Research

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "D2: Operations Research and Fuzzy Decision Making".

Deadline for manuscript submissions: 20 November 2026 | Viewed by 916

Special Issue Editor


E-Mail Website
Guest Editor
Economics Discipline Group, School of Business, University of Technology Sydney, Sydney, NSW 2007, Australia
Interests: economic theory; industrial organization; operation management
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

This Special Issue of Mathematics is dedicated to the intersection of Game Theory and Operations Research, two fundamental disciplines that provide rigorous tools for analyzing strategic interactions and optimizing complex decision-making processes.

We welcome high-quality original research articles, surveys, and methodological advances that explore the theoretical, computational, and applied aspects of game theory and operations research. Topics of interest include, but are not limited to, the following:

  • Cooperative and non-cooperative game theory;
  • Mechanisms and market design;
  • Auctions and matching markets;
  • Stochastic and dynamic games;
  • Optimization in networked and multi-agent systems;
  • Decision making under uncertainty;
  • Applications in logistics, supply chains, energy markets, health care, and public policy.

By bridging theoretical insights with real-world applications, this Special Issue aims to showcase innovative contributions that push the boundaries of how strategic and operational models can inform better outcomes across industries and institutions.

We invite submissions from researchers in economics, mathematics, engineering, computer science, and related fields whose work advances the frontier of these interconnected domains.

Dr. Jun Zhang
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 250 words) can be sent to the Editorial Office for assessment.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • game theory
  • operations research
  • mechanism design
  • auction theory
  • cooperative games
  • non-cooperative games
  • optimization
  • decision theory
  • dynamic games
  • stochastic games
  • network games
  • multi-agent systems
  • matching markets
  • resource allocation
  • strategic interaction
  • mathematical programming
  • supply chain management
  • scheduling and logistics
  • algorithmic game theory
  • equilibrium analysis

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

23 pages, 638 KB  
Article
Optimal Allocations Under Strongly Pigou–Dalton Criteria: Hidden Layer Structure and Efficient Combinatorial Approach
by Taikun Zhu, Kai Jin, Ruixi Luo and Song Cao
Mathematics 2026, 14(4), 658; https://doi.org/10.3390/math14040658 - 12 Feb 2026
Viewed by 368
Abstract
We investigate optimal social welfare allocations of m items to n agents with binary additive or submodular valuations. For binary additive valuations, we prove that the set of optimal allocations coincides with the set of so-called stable allocations, as long as the [...] Read more.
We investigate optimal social welfare allocations of m items to n agents with binary additive or submodular valuations. For binary additive valuations, we prove that the set of optimal allocations coincides with the set of so-called stable allocations, as long as the employed criterion for evaluating social welfare is strongly Pigou–Dalton (SPD) and symmetric. Many common criteria are SPD and symmetric, such as Nash social welfare, LexiMax, LexiMin, the Gini Index, Entropy, and Envy Sum. We also design efficient algorithms for finding a stable allocation, including an O(m2n) time algorithm for the case of indivisible items, and an O(m2n5) time one for the case of divisible items. The first is faster than the existing algorithms or has a simpler analysis. The latter is the first combinatorial algorithm for that problem. It utilizes a hidden layer partition of items and agents admitted by all stable allocations, and cleverly reduces the case of divisible items to the case of indivisible items. In addition, we show that the profiles of different optimal allocations have a small Chebyshev distance, which is zero for the case of divisible items under binary additive valuations, and is at most one for the case of indivisible items under binary submodular valuations. Full article
(This article belongs to the Special Issue Game Theory and Operations Research)
Show Figures

Figure 1

Back to TopTop