Approximately Bisubmodular Regret Minimization in Billboard and Social Media Advertising

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Ali, Dildar, Benerjee, Suman, Prasad, Yamuna
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Computer Science and Game Theory Databases Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Influential Slot and Tag Selection in Billboard Advertisement
di: Ali, Dildar, et al.
Pubblicazione: (2024)

Fairness Driven Slot Allocation Problem in Billboard Advertisement
di: Ali, Dildar, et al.
Pubblicazione: (2025)

Multi-Slot Tag Assignment Problem in Billboard Advertisement
di: Ali, Dildar, et al.
Pubblicazione: (2024)

Multi-product Influence Maximization in Billboard Advertisement
di: Ali, Dildar, et al.
Pubblicazione: (2025)

An Effective Tag Assignment Approach for Billboard Advertisement
di: Ali, Dildar, et al.
Pubblicazione: (2024)

Group Trip Planning Query Problem with Multimodal Journey
di: Ali, Dildar, et al.
Pubblicazione: (2025)

Minimizing Regret in Billboard Advertisement under Zonal Influence Constraint
di: Ali, Dildar, et al.
Pubblicazione: (2024)

Simultaneous Swap Regret Minimization via KL-Calibration
di: Luo, Haipeng, et al.
Pubblicazione: (2025)

Approximating Nash Social Welfare by Matching and Local Search
di: Garg, Jugal, et al.
Pubblicazione: (2022)

Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
di: Feng, Yuda, et al.
Pubblicazione: (2024)

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
di: Bei, Xiaohui, et al.
Pubblicazione: (2025)

A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
di: Feng, Yuda, et al.
Pubblicazione: (2024)

Towards Regret Free Slot Allocation in Billboard Advertisement
di: Ali, Dildar, et al.
Pubblicazione: (2024)

Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
di: Brown, Adam, et al.
Pubblicazione: (2024)

Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization
di: Ali, Dildar, et al.
Pubblicazione: (2026)

Logarithmic Approximation for Road Pricing on Grids
di: Constantinescu, Andrei, et al.
Pubblicazione: (2025)

Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations
di: Halpern, Daniel, et al.
Pubblicazione: (2025)

Welfare Approximation in Additively Separable Hedonic Games
di: Bullinger, Martin, et al.
Pubblicazione: (2025)

An FPTAS for 7/9-Approximation to Maximin Share Allocations
di: Huang, Xin, et al.
Pubblicazione: (2025)

More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
di: Gupta, Sushmita, et al.
Pubblicazione: (2025)

Beyond the Half-Approximation: Fair and Efficient Online Class Matching
di: Borst, Sander, et al.
Pubblicazione: (2026)

Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
di: Segev, Danny, et al.
Pubblicazione: (2020)

Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations
di: Andersen, Martin Jupakkal, et al.
Pubblicazione: (2025)

Polynomial-Time Approximation Schemes via Utility Alignment: Unit-Demand Pricing and More
di: Bowers, Robin, et al.
Pubblicazione: (2025)

Minimization I.I.D. Prophet Inequality via Extreme Value Theory: A Unified Approach
di: Livanos, Vasilis, et al.
Pubblicazione: (2024)

Balanced Popularity in Multi-Product Billboard Advertisement
di: Ali, Dildar, et al.
Pubblicazione: (2025)

Efficiency of Proportional Mechanisms in Online Auto-Bidding Advertising
di: Thang, Nguyen Kim
Pubblicazione: (2026)

High-Dimensional Calibration from Swap Regret
di: Fishelson, Maxwell, et al.
Pubblicazione: (2025)

Strategizing against No-Regret Learners in First-Price Auctions
di: Rubinstein, Aviad, et al.
Pubblicazione: (2024)

Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
di: Liu, Junyan, et al.
Pubblicazione: (2025)

Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
di: Collina, Natalie, et al.
Pubblicazione: (2024)

Improved MMS Approximations for Few Agent Types
di: Garg, Jugal, et al.
Pubblicazione: (2025)

Procurement Auctions via Approximately Optimal Submodular Optimization
di: Deng, Yuan, et al.
Pubblicazione: (2024)

Best of Both Worlds Guarantees for Equitable Allocations
di: Bhaskar, Umang, et al.
Pubblicazione: (2025)

Universal Online Contention Resolution with Preselected Order
di: Zhao, Junyao
Pubblicazione: (2025)

The Min Max Average Cycle Weight Problem
di: Elmalem, Noga Klein, et al.
Pubblicazione: (2025)

Online Job Assignment
di: Ekbatani, Farbod, et al.
Pubblicazione: (2025)

Online Allocation with Multi-Class Arrivals: Group Fairness vs Individual Welfare
di: Zargari, Faraz, et al.
Pubblicazione: (2025)

Best-of-Both-Worlds Guarantees with Fairer Endings
di: Kavitha, Telikepalli, et al.
Pubblicazione: (2025)

Maximizing social welfare among EF1 allocations at the presence of two types of agents
di: Ma, Jiaxuan, et al.
Pubblicazione: (2025)