The field of game theory and community detection is rapidly evolving, with a focus on developing new algorithms and models to analyze complex networks and systems. Recent research has explored the use of mean-payoff and energy objectives in discrete-bidding games, as well as the application of Lagrangian relaxation to multi-action partially observable restless bandits. Additionally, there has been a surge of interest in community detection methods, including the use of Fortunato's performance measure and hierarchical single-linkage clustering. Noteworthy papers in this area include the development of a strongly polynomial-time combinatorial algorithm for the nucleolus in convex games and the proposal of a new deception metric for unnoticeable community deception via multi-objective optimization. Overall, the field is moving towards the development of more efficient and effective algorithms for analyzing complex systems and networks.
Advances in Game Theory and Community Detection
Sources
Mean-payoff and Energy Discrete Bidding Games
Lagrangian Relaxation for Multi-Action Partially Observable Restless Bandits: Heuristic Policies and Indexability
Community Detection using Fortunato's Performance Measure
Unnoticeable Community Deception via Multi-objective Optimization
Speeding Up the NSGA-II via Dynamic Population Sizes
A Continuous Energy Ising Machine Leveraging Difference-of-Convex Programming
Complexity of the Existence of Constrained Secure Equilibria in Multi-Player Games
Hierarchical Single-Linkage Clustering for Community Detection with Overlaps and Outliers
A Strongly Polynomial-Time Combinatorial Algorithm for the Nucleolus in Convex Games
Selecting Interlacing Committees
On the Optimization of Methods for Establishing Well-Connected Communities
From Leiden to Pleasure Island: The Constant Potts Model for Community Detection as a Hedonic Game
Using causal abstractions to accelerate decision-making in complex bandit problems
On approximating the $f$-divergence between two Ising models
Hierarchical Decision-Making in Population Games
Parameterized Algorithms for Computing Pareto Sets
The Game is the Game: Dynamic network analysis and shifting roles in criminal networks
Efficiently Computing Equilibria in Budget-Aggregation Games
Optimization of geometric hypergraph embedding