:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Yang, Jianyi, Li, Pengfei, Islam, Mohammad Jaminur, Ren, Shaolei
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory Performance
Online Access:	https://arxiv.org/abs/2401.04340
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Budgeted Matching with General Bids
by: Yang, Jianyi, et al.
Published: (2024)

Decentralized Edge Caching under Budget and Storage Constraints: A Game-Theoretic Approach
by: Sedghani, Hamta, et al.
Published: (2026)

Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness
by: Fikioris, Giannis, et al.
Published: (2023)

Optimal Allocation of Tasks and Price of Anarchy of Distributed Optimization in Networked Computing Facilities
by: Mancuso, Vincenzo, et al.
Published: (2024)

Game of arrivals at a two queue network with heterogeneous customer routes
by: Bandyopadhyay, Agniv, et al.
Published: (2023)

Online Budget Allocation with Censored Semi-Bandit Feedback
by: Bachoc, François, et al.
Published: (2025)

Online Fair Allocations with Binary Valuations and Beyond
by: Wang, Yuanyuan, et al.
Published: (2025)

Amdahl's and Gustafson-Barsis laws revisited
by: Karbowski, Andrzej
Published: (2008)

User Data Sharing Frameworks: A Blockchain-Based Incentive Solution
by: Shrestha, Ajay Kumar, et al.
Published: (2019)

Achieving Coordination in Non-Cooperative Joint Replenishment Games
by: Luo, Junjie, et al.
Published: (2025)

Sequential Fair Allocation With Replenishments: A Little Envy Goes An Exponentially Long Way
by: Onyeze, Chido, et al.
Published: (2025)

Game-theoretic Distributed Learning Approach for Heterogeneous-cost Task Allocation with Budget Constraints
by: Yang, Weiyi, et al.
Published: (2024)

Worst- and Average-Case Robustness of Stable Matchings: (Counting) Complexity and Experiments
by: Boehmer, Kimon, et al.
Published: (2024)

Online Budget-Feasible Mechanism Design with Predictions
by: Amanatidis, Georgios, et al.
Published: (2025)

Online MMS Allocation for Chores
by: Song, Jiaxin, et al.
Published: (2025)

Safe Exploitative Play with Untrusted Type Beliefs
by: Li, Tongxin, et al.
Published: (2024)

Truthful Budget Aggregation: Beyond Moving-Phantom Mechanisms
by: de Berg, Mark, et al.
Published: (2024)

Online Resource Allocation With General Constraints
by: Chiefari, Eleonora Fidelia, et al.
Published: (2026)

Resource Allocation in Electricity Markets with Budget Constrained Customers
by: Perkins, Lila, et al.
Published: (2026)

An Adaptable Budget Planner for Enhancing Budget-Constrained Auto-Bidding in Online Advertising
by: Duan, Zhijian, et al.
Published: (2025)

Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents
by: Amanatidis, Georgios, et al.
Published: (2023)

Scheduling with Uncertain Holding Costs and its Application to Content Moderation
by: Gocmen, Caner, et al.
Published: (2025)

Learning to Defer in Congested Systems: The AI-Human Interplay
by: Lykouris, Thodoris, et al.
Published: (2024)

Epistemic Selection of Costly Alternatives: The Case of Participatory Budgeting
by: Rey, Simon, et al.
Published: (2023)

Budget-feasible Egalitarian Allocation of Conflicting Jobs
by: Gupta, Sushmita, et al.
Published: (2024)

Online Resource Allocation via Static Bundle Pricing
by: Fotakis, Dimitris, et al.
Published: (2025)

Contiguous Allocation of Indivisible Items on a Path
by: Kawase, Yasushi, et al.
Published: (2024)

Online EFX Allocations with Predictions
by: Melissourgos, Themistoklis, et al.
Published: (2025)

Asymmetries of Service: Interdependence and Synchronicity
by: Daw, Andrew, et al.
Published: (2024)

The Computational Intractability of Not Worst Responding
by: Ahunbay, Mete Şeref, et al.
Published: (2026)

Beyond Arbitrary Allocations: Security Values in Constrained General Lotto Games
by: Paarporn, Keith, et al.
Published: (2026)

A New Benchmark for Online Learning with Budget-Balancing Constraints
by: Braverman, Mark, et al.
Published: (2025)

Budget-Feasible Contracts
by: Feldman, Michal, et al.
Published: (2025)

Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations
by: Kaviani, Alireza, et al.
Published: (2024)

Sybil-Proof Mechanism for Information Propagation with Budgets
by: Zheng, Junjie, et al.
Published: (2024)

Online Resource Allocation with Cancellations
by: Ekbatani, Farbod, et al.
Published: (2022)

Online Fair Division With Subsidy: When Do Envy-Free Allocations Exist, and at What Cost?
by: Kulkarni, Pooja, et al.
Published: (2025)

Worst-case control via linear programming: applications to truncation selection and partially malicious players
by: Zhang, Zhuoer, et al.
Published: (2024)

Beyond Revenue and Welfare: Counterfactual Analysis of Spectrum Auctions with Application to Canada's 3800MHz Allocation
by: Shani, Sara Jalili, et al.
Published: (2025)

Budget-Constrained Auctions with Unassured Priors: Strategic Equivalence and Structural Properties
by: Chen, Zhaohua, et al.
Published: (2022)