일반화된 연합 구성을 갖는 협력적 게임을 위한 흐름 방법
이 논문에서는 일반화된 연합 구성을 갖는 협력적 게임에서 한정된 협력 관계와 연합 프로필 함수를 기반으로 한 새로운 가치 분배 방법인 흐름 방법을 제시하고, 이 흐름 방법이 두 단계로 분해될 수 있음을 보여주며, 공리적 특성화를 제공합니다.
Calculating Profits and Losses for Algorithmic Trading Strategies: A Comprehensive Guide Incorporating Spread and Trade Specifics
This guide presents a detailed methodology for accurately calculating realized and unrealized profits and losses (PnL) in algorithmic trading, considering factors like spread, fees, and trade direction, which are often overlooked in standard finance texts.
On Parametric Formulations for the Asymmetric Traveling Salesman Problem: A Comparative Analysis of the d-MTZ, d-DL, and b-SCF Formulations
This paper introduces and analyzes families of parametric formulations for the Asymmetric Traveling Salesman Problem (ATSP), demonstrating that the classic MTZ, DL, and SCF formulations are specific instances within these families and that no single formulation consistently dominates the others.
On Inducing Tangles in Graphs Through Vertex Sets and Weight Functions
This research paper investigates whether every tangle in a graph can be induced by a set of vertices or a weight function, aiming to reduce the problem to graphs of a bounded size and exploring the implications of a positive answer.
本地演算法入門
對於圖論問題，本地演算法的效能可以透過分析其序列版本來理解，並且隨機性對其複雜度的影響有限。
로컬 알고리즘 소개 및 최근 연구 동향
로컬 알고리즘은 분산 컴퓨팅 및 이산 수학 분야에서 중요한 개념이며, 특히 네트워크 분해를 활용한 효율적인 알고리즘 설계 및 분석 기법이 활발히 연구되고 있습니다.
ローカルアルゴリズム入門
ローカルアルゴリズムは、分散コンピューティングと離散数学の境界領域に位置する、近年著しい進歩を遂げている分野であり、本稿では、その概念的枠組みと計算量理論的側面を探求し、逐次ローカルアルゴリズムと分散ローカルアルゴリズムの等価性、ランダム性の影響、ネットワーク分解の役割について解説する。
Introduction to the Theory and Applications of Distributed Local Algorithms
For local problems on graphs, distributed and sequential local algorithms are computationally equivalent up to polylogarithmic factors, and randomness in these algorithms can be eliminated with a polylogarithmic slowdown.
A Quasi-Polynomial Time Algorithm for the Maximum Weight Independent Set Problem in Graphs Without Long Claws
The Maximum Weight Independent Set (MWIS) problem can be solved in quasi-polynomial time for graphs that exclude any induced subgraph with all connected components being paths or trees with at most three leaves.
基於直接存取的彙總連接查詢高效解答方法
本文探討如何利用直接存取方法，高效地評估帶有分組和彙總的連接查詢，並分析了查詢的複雜度和可處理性條件。
