:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yang, Jianyi, Li, Pengfei, Islam, Mohammad Jaminur, Ren, Shaolei
Format:	Preprint
Publié:	2024
Sujets:	Computer Science and Game Theory Performance
Accès en ligne:	https://arxiv.org/abs/2401.04340
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Budgeted Matching with General Bids
par: Yang, Jianyi, et autres
Publié: (2024)

Decentralized Edge Caching under Budget and Storage Constraints: A Game-Theoretic Approach
par: Sedghani, Hamta, et autres
Publié: (2026)

Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness
par: Fikioris, Giannis, et autres
Publié: (2023)

Optimal Allocation of Tasks and Price of Anarchy of Distributed Optimization in Networked Computing Facilities
par: Mancuso, Vincenzo, et autres
Publié: (2024)

Game of arrivals at a two queue network with heterogeneous customer routes
par: Bandyopadhyay, Agniv, et autres
Publié: (2023)

Online Budget Allocation with Censored Semi-Bandit Feedback
par: Bachoc, François, et autres
Publié: (2025)

Online Fair Allocations with Binary Valuations and Beyond
par: Wang, Yuanyuan, et autres
Publié: (2025)

Amdahl's and Gustafson-Barsis laws revisited
par: Karbowski, Andrzej
Publié: (2008)

User Data Sharing Frameworks: A Blockchain-Based Incentive Solution
par: Shrestha, Ajay Kumar, et autres
Publié: (2019)

Achieving Coordination in Non-Cooperative Joint Replenishment Games
par: Luo, Junjie, et autres
Publié: (2025)

Sequential Fair Allocation With Replenishments: A Little Envy Goes An Exponentially Long Way
par: Onyeze, Chido, et autres
Publié: (2025)

Game-theoretic Distributed Learning Approach for Heterogeneous-cost Task Allocation with Budget Constraints
par: Yang, Weiyi, et autres
Publié: (2024)

Worst- and Average-Case Robustness of Stable Matchings: (Counting) Complexity and Experiments
par: Boehmer, Kimon, et autres
Publié: (2024)

Online Budget-Feasible Mechanism Design with Predictions
par: Amanatidis, Georgios, et autres
Publié: (2025)

Online MMS Allocation for Chores
par: Song, Jiaxin, et autres
Publié: (2025)

Safe Exploitative Play with Untrusted Type Beliefs
par: Li, Tongxin, et autres
Publié: (2024)

Truthful Budget Aggregation: Beyond Moving-Phantom Mechanisms
par: de Berg, Mark, et autres
Publié: (2024)

Online Resource Allocation With General Constraints
par: Chiefari, Eleonora Fidelia, et autres
Publié: (2026)

Resource Allocation in Electricity Markets with Budget Constrained Customers
par: Perkins, Lila, et autres
Publié: (2026)

An Adaptable Budget Planner for Enhancing Budget-Constrained Auto-Bidding in Online Advertising
par: Duan, Zhijian, et autres
Publié: (2025)

Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents
par: Amanatidis, Georgios, et autres
Publié: (2023)

Scheduling with Uncertain Holding Costs and its Application to Content Moderation
par: Gocmen, Caner, et autres
Publié: (2025)

Learning to Defer in Congested Systems: The AI-Human Interplay
par: Lykouris, Thodoris, et autres
Publié: (2024)

Epistemic Selection of Costly Alternatives: The Case of Participatory Budgeting
par: Rey, Simon, et autres
Publié: (2023)

Budget-feasible Egalitarian Allocation of Conflicting Jobs
par: Gupta, Sushmita, et autres
Publié: (2024)

Online Resource Allocation via Static Bundle Pricing
par: Fotakis, Dimitris, et autres
Publié: (2025)

Contiguous Allocation of Indivisible Items on a Path
par: Kawase, Yasushi, et autres
Publié: (2024)

Online EFX Allocations with Predictions
par: Melissourgos, Themistoklis, et autres
Publié: (2025)

Asymmetries of Service: Interdependence and Synchronicity
par: Daw, Andrew, et autres
Publié: (2024)

The Computational Intractability of Not Worst Responding
par: Ahunbay, Mete Şeref, et autres
Publié: (2026)

Beyond Arbitrary Allocations: Security Values in Constrained General Lotto Games
par: Paarporn, Keith, et autres
Publié: (2026)

A New Benchmark for Online Learning with Budget-Balancing Constraints
par: Braverman, Mark, et autres
Publié: (2025)

Budget-Feasible Contracts
par: Feldman, Michal, et autres
Publié: (2025)

Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations
par: Kaviani, Alireza, et autres
Publié: (2024)

Sybil-Proof Mechanism for Information Propagation with Budgets
par: Zheng, Junjie, et autres
Publié: (2024)

Online Resource Allocation with Cancellations
par: Ekbatani, Farbod, et autres
Publié: (2022)

Online Fair Division With Subsidy: When Do Envy-Free Allocations Exist, and at What Cost?
par: Kulkarni, Pooja, et autres
Publié: (2025)

Worst-case control via linear programming: applications to truncation selection and partially malicious players
par: Zhang, Zhuoer, et autres
Publié: (2024)

Beyond Revenue and Welfare: Counterfactual Analysis of Spectrum Auctions with Application to Canada's 3800MHz Allocation
par: Shani, Sara Jalili, et autres
Publié: (2025)

Budget-Constrained Auctions with Unassured Priors: Strategic Equivalence and Structural Properties
par: Chen, Zhaohua, et autres
Publié: (2022)