Algorithms and Complexity of Influence Maximization on Directed Acyclic Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Liu, Panfeng, Tao, Biaoshuai |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Approximability Landscape of Welfare Maximization within Fair Allocations
by: Bu, Xiaolin, et al.
Published: (2022)
by: Bu, Xiaolin, et al.
Published: (2022)
On Pareto-Optimal and Fair Allocations with Personalized Bi-Valued Utilities
by: Jin, Jiarong, et al.
Published: (2025)
by: Jin, Jiarong, et al.
Published: (2025)
Fair and Almost Truthful Mechanisms for Additive Valuations and Beyond
by: Tao, Biaoshuai, et al.
Published: (2023)
by: Tao, Biaoshuai, et al.
Published: (2023)
Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness
by: Bu, Xiaolin, et al.
Published: (2024)
by: Bu, Xiaolin, et al.
Published: (2024)
Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods
by: Bu, Xiaolin, et al.
Published: (2024)
by: Bu, Xiaolin, et al.
Published: (2024)
Aggregation of Antagonistic Contingent Preferences: When Is It Possible?
by: Deng, Xiaotie, et al.
Published: (2024)
by: Deng, Xiaotie, et al.
Published: (2024)
The Degree of (Extended) Justified Representation and Its Optimization
by: Tao, Biaoshuai, et al.
Published: (2024)
by: Tao, Biaoshuai, et al.
Published: (2024)
A Complete Landscape for the Price of Envy-Freeness
by: Li, Zihao, et al.
Published: (2024)
by: Li, Zihao, et al.
Published: (2024)
The Complexity of Tournament Fixing: Subset FAS Number and Acyclic Neighborhoods
by: Liu, Yuxi, et al.
Published: (2026)
by: Liu, Yuxi, et al.
Published: (2026)
Aggregating Information and Preferences with Bounded-Size Deviations
by: Han, Qishen, et al.
Published: (2025)
by: Han, Qishen, et al.
Published: (2025)
The Art of Two-Round Voting
by: Han, Qishen, et al.
Published: (2025)
by: Han, Qishen, et al.
Published: (2025)
Strong Equilibria in Bayesian Games with Bounded Group Size
by: Han, Qishen, et al.
Published: (2025)
by: Han, Qishen, et al.
Published: (2025)
Online MMS Allocation for Chores
by: Song, Jiaxin, et al.
Published: (2025)
by: Song, Jiaxin, et al.
Published: (2025)
Incentive Analysis of Collusion in Fair Division
by: Huang, Haoqiang, et al.
Published: (2025)
by: Huang, Haoqiang, et al.
Published: (2025)
The Incentive Guarantees Behind Nash Welfare in Divisible Resources Allocation
by: Bei, Xiaohui, et al.
Published: (2023)
by: Bei, Xiaohui, et al.
Published: (2023)
Fair Division with Allocator's Preference
by: Bu, Xiaolin, et al.
Published: (2023)
by: Bu, Xiaolin, et al.
Published: (2023)
Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods
by: Bu, Xiaolin, et al.
Published: (2024)
by: Bu, Xiaolin, et al.
Published: (2024)
Likelihood of the Existence of Average Justified Representation
by: Han, Qishen, et al.
Published: (2025)
by: Han, Qishen, et al.
Published: (2025)
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
by: Maiti, Arnab, et al.
Published: (2025)
by: Maiti, Arnab, et al.
Published: (2025)
When is Truthfully Allocating Chores no Harder than Goods?
by: Li, Bo, et al.
Published: (2025)
by: Li, Bo, et al.
Published: (2025)
It's Not All Black and White: Degree of Truthfulness for Risk-Avoiding Agents
by: Hartman, Eden, et al.
Published: (2025)
by: Hartman, Eden, et al.
Published: (2025)
On the Coordination of Value-Maximizing Bidders
by: Guan, Yanru, et al.
Published: (2025)
by: Guan, Yanru, et al.
Published: (2025)
BONUS! Maximizing Surprise
by: Huang, Zhihuan, et al.
Published: (2021)
by: Huang, Zhihuan, et al.
Published: (2021)
Control in Stable Marriage and Stable Roommates: Complexity and Algorithms
by: Chen, Jiehua, et al.
Published: (2025)
by: Chen, Jiehua, et al.
Published: (2025)
Maximally Random Sortition
by: de Azevedo, Gabriel, et al.
Published: (2026)
by: de Azevedo, Gabriel, et al.
Published: (2026)
Generalizing Better Response Paths and Weakly Acyclic Games
by: Yongacoglu, Bora, et al.
Published: (2024)
by: Yongacoglu, Bora, et al.
Published: (2024)
Concurrent Stochastic Games with Stateful-discounted and Parity Objectives: Complexity and Algorithms
by: Asadi, Ali, et al.
Published: (2024)
by: Asadi, Ali, et al.
Published: (2024)
Online Revenue Maximization for Server Pricing
by: Boodaghians, Shant, et al.
Published: (2019)
by: Boodaghians, Shant, et al.
Published: (2019)
A Survey on Location-Driven Influence Maximization
by: Cai, Taotao, et al.
Published: (2022)
by: Cai, Taotao, et al.
Published: (2022)
Mechanism Design via Market Clearing-Prices for Value Maximizers under Budget and RoS Constraints
by: Liu, Xiaodong, et al.
Published: (2026)
by: Liu, Xiaodong, et al.
Published: (2026)
Tight Inapproximability for Welfare-Maximizing Autobidding Equilibria
by: Anagnostides, Ioannis, et al.
Published: (2026)
by: Anagnostides, Ioannis, et al.
Published: (2026)
Maximizing the Egalitarian Welfare in Friends and Enemies Games
by: Elkind, Edith, et al.
Published: (2025)
by: Elkind, Edith, et al.
Published: (2025)
Network Creation Games with 2-Neighborhood Maximization
by: de la Haye, Merlin, et al.
Published: (2025)
by: de la Haye, Merlin, et al.
Published: (2025)
On Truthful Item-Acquiring Mechanisms for Reward Maximization
by: Shan, Liang, et al.
Published: (2024)
by: Shan, Liang, et al.
Published: (2024)
Multi-Parameter Mechanisms for Consumer Surplus Maximization
by: Ezra, Tomer, et al.
Published: (2024)
by: Ezra, Tomer, et al.
Published: (2024)
When Graph Traversal Meets Structured Preferences: Unified Framework and Complexity Results
by: Rong, Guozhen, et al.
Published: (2026)
by: Rong, Guozhen, et al.
Published: (2026)
Learning Equilibria in Coordination Games via Minorization-Maximization
by: S., Ashok Krishnan K., et al.
Published: (2026)
by: S., Ashok Krishnan K., et al.
Published: (2026)
Social Welfare Maximization for Federated Learning with Network Effects
by: Li, Xiang, et al.
Published: (2024)
by: Li, Xiang, et al.
Published: (2024)
Computing Welfare-Maximizing Fair Allocations of Indivisible Goods
by: Aziz, Haris, et al.
Published: (2020)
by: Aziz, Haris, et al.
Published: (2020)
Multidimensional Bayesian Utility Maximization: Tight Approximations to Welfare
by: Goldner, Kira, et al.
Published: (2024)
by: Goldner, Kira, et al.
Published: (2024)
Similar Items
-
Approximability Landscape of Welfare Maximization within Fair Allocations
by: Bu, Xiaolin, et al.
Published: (2022) -
On Pareto-Optimal and Fair Allocations with Personalized Bi-Valued Utilities
by: Jin, Jiarong, et al.
Published: (2025) -
Fair and Almost Truthful Mechanisms for Additive Valuations and Beyond
by: Tao, Biaoshuai, et al.
Published: (2023) -
Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness
by: Bu, Xiaolin, et al.
Published: (2024) -
Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods
by: Bu, Xiaolin, et al.
Published: (2024)