:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Aarts, Sander, Dentes, Jacob, Wu, Manxi, Shmoys, David
Format:	Preprint
Published:	2023
Subjects:	Computer Science and Game Theory
Online Access:	https://arxiv.org/abs/2309.16914
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tight Bounds for The Price of Fairness
by: Cao, Yifeng, et al.
Published: (2023)

Combatting Gerrymandering with Ranked Choice Voting: An Experimental Analysis of Multi-member Districts in the United States
by: Garg, Nikhil, et al.
Published: (2021)

Market Design for Capacity Sharing in Networks
by: Amin, Saurabh, et al.
Published: (2023)

Stochastic Knapsack with Costs: On Adaptivity and Return-on-Investment
by: Barak, Zohar, et al.
Published: (2025)

Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design
by: Ma, Mengfan, et al.
Published: (2024)

Bin Packing and Covering: Pushing the Frontier on the Maximin Share Fairness
by: Li, Bo, et al.
Published: (2025)

Learning with Episodic Hypothesis Testing in General Games: A Framework for Equilibrium Selection
by: Yang, Ruifan, et al.
Published: (2025)

Designing High-Occupancy Toll Lanes: A Game-Theoretic Analysis
by: Zhang, Zhanhao, et al.
Published: (2024)

Near-Optimal Best-of-Both-Worlds Fairness for Few Agents
by: Babaioff, Moshe, et al.
Published: (2026)

Interpretable Price Bounds Estimation with Shape Constraints in Price Optimization
by: Ikeda, Shunnosuke, et al.
Published: (2024)

Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations
by: Bismuth, Samuel, et al.
Published: (2019)

Optimal Mechanism in a Dynamic Stochastic Knapsack Environment
by: Jung, Jihyeok, et al.
Published: (2024)

Learning to Recommend in Unknown Games
by: Alanqary, Arwa, et al.
Published: (2026)

Algorithmic Pricing and Algorithmic Collusion
by: Bichler, Martin, et al.
Published: (2025)

The Price of Opportunity Fairness in Matroid Allocation Problems
by: Castera, Rémi, et al.
Published: (2024)

Adversarial Knapsack for Sequential Competitive Resource Allocation
by: Thakoor, Omkar, et al.
Published: (2025)

Fair Division via the Cake-Cutting Share
by: Bai, Yannan, et al.
Published: (2024)

Fair Allocation under Conflict Constraints
by: Equbal, Sarfaraz, et al.
Published: (2026)

Incentives for Early Arrival in Cost Sharing
by: Zhang, Junyu, et al.
Published: (2024)

Strategic Bidding in Knapsack Auctions
by: Khezr, Peyman, et al.
Published: (2024)

Bridging Theory and Perception in Fair Division: A Study on Comparative and Fair Share Notions
by: Hosseini, Hadi, et al.
Published: (2025)

Oh the Prices You'll See: Designing a Fair Exchange System to Mitigate Personalized Pricing
by: Karan, Aditya, et al.
Published: (2024)

Exact Maximin Share Fairness via Adjusted Supply
by: Barman, Siddharth, et al.
Published: (2025)

Optimal Fixed-Price Mechanism with Signaling
by: Fan, Zhikang, et al.
Published: (2024)

Incentivizing Time-Aware Fairness in Data Sharing
by: Chen, Jiangwei, et al.
Published: (2025)

Game-to-Real Gap: Quantifying the Effect of Model Misspecification in Network Games
by: Ferguson, Bryce L., et al.
Published: (2026)

Existence and Computation of Fair Allocations under Constraints
by: Barman, Siddharth, et al.
Published: (2026)

Tight Asymptotic Bounds for Fair Division With Externalities
by: Connor, Frank, et al.
Published: (2026)

Dynamic Pricing based Near-Optimal Resource Allocation for Elastic Edge Offloading
by: Xia, Yun, et al.
Published: (2024)

Searching for Optimal Prices in Two-Sided Markets
by: Feng, Yiding, et al.
Published: (2026)

Share-Based Fairness for Arbitrary Entitlements
by: Babaioff, Moshe, et al.
Published: (2024)

Fair Societies: Algorithms for House Allocations
by: Hosseini, Hadi, et al.
Published: (2025)

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

Competitive Demand Learning: A Non-cooperative Pricing Algorithm with Coordinated Price Experimentation
by: Yang, Yongge, et al.
Published: (2020)

Low Cost, Fair, and Representative Committees in a Metric Space
by: Jerrett, Christopher, et al.
Published: (2025)

Maximin Fair Allocation of Indivisible Items under Cost Utilities
by: Botan, Sirin, et al.
Published: (2024)

Maximin Share Guarantees via Limited Cost-Sensitive Sharing
by: Salavcova, Hana, et al.
Published: (2026)

Online Optimization Algorithms in Repeated Price Competition: Equilibrium Learning and Algorithmic Collusion
by: Bichler, Martin, et al.
Published: (2024)

Near-Optimal Dropout-Robust Sortition
by: Gambhir, Maya Pal, et al.
Published: (2025)

Fairness-aware Contextual Dynamic Pricing with Strategic Buyers
by: Liu, Pangpang, et al.
Published: (2025)