Advances in Optimization and Game Theory

The field of optimization and game theory is witnessing significant developments, with a focus on innovative solutions and advanced methodologies. Researchers are exploring new approaches to solve complex problems, such as disruption management in airline operations, load balancing in satellite-cell-free massive MIMO systems, and equilibrium refinements in potential games. The use of machine learning, evolutionary algorithms, and other optimization techniques is becoming increasingly prevalent. Notably, the concept of solution space topology is being applied to guide search algorithms, and new types of attractors are being introduced to solve parity games in polynomial time.

Some noteworthy papers in this area include: The paper on Disruption Management in Airline Operations presents a solver-based approach using time-space network optimization, which provides a scalable decision-support capability for operations control centers. The paper on Attractors Is All You Need: Parity Games In Polynomial Time introduces a new type of attractor that can guarantee finding the minimal dominion of a parity game, allowing for a polynomial-time algorithm.

Sources

Disruption Management in Airline Operations: A Solver-based Approach using Time-Space Network Optimization

Dual-Scale Antenna Deployment for Pinching Antenna Systems

Computation as a Game

Efficient Generation of Binary Magic Squares

Fairness Designs for Load Balancing Optimization in Satellite-Cell-Free Massive MIMO Systems

A Physical Analogy between Molecular Ordering and SAT-to-Ising Annealing

Evolutionary Dynamics in Continuous-time Finite-state Mean Field Games - Part I: Equilibria

Solution Space Topology Guides CMTS Search

Ergodic Rate Analysis of Two-State Pinching-Antenna Systems

Attractors Is All You Need: Parity Games In Polynomial Time

Environment Division Multiple Access (EDMA): A Feasibility Study via Pinching Antennas

The Complexity of Equilibrium Refinements in Potential Games

A Reinforced Evolution-Based Approach to Multi-Resource Load Balancing

Solving Convex Partition Visual Jigsaw Puzzles

Built with on top of