Cover Image

Finding Pareto frontier for one-sided matching

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dodda, Bhavik, Shakya, Garima
Format:	Preprint
Published:	2026
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fairness and efficiency trade-off in two-sided matching
by: Cho, Sung-Ho, et al.
Published: (2024)

The Power of Two-sided Recruitment in Two-sided Markets
by: Cai, Yang, et al.
Published: (2023)

Pareto-Optimal Algorithms for Learning in Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)

Pareto Optimality in Approval-Based Multiwinner Voting
by: Schünke, Joshua
Published: (2026)

Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives
by: Brihaye, Thomas, et al.
Published: (2023)

Proportional and Pareto-Optimal Allocation of Chores with Subsidy
by: Garg, Jugal, et al.
Published: (2025)

Pareto-Efficient Multi-Buyer Mechanisms: Characterization, Fairness and Welfare
by: Babaioff, Moshe, et al.
Published: (2026)

On Pareto-Optimal and Fair Allocations with Personalized Bi-Valued Utilities
by: Jin, Jiarong, et al.
Published: (2025)

Achieving Pareto Optimality in Games via Single-bit Feedback
by: Kiremitci, Seref Taha, et al.
Published: (2025)

Safe Pareto Improvements for Expected Utility Maximizers in Program Games
by: DiGiovanni, Anthony, et al.
Published: (2024)

Resolute and symmetric mechanisms for two-sided matching problems
by: Bubboloni, Daniela, et al.
Published: (2024)

Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability
by: Tröbst, Thorben, et al.
Published: (2024)

Fair metric distortion for matching with preferences
by: Hastings, Jabari, et al.
Published: (2025)

Promises Made, Promises Kept: Safe Pareto Improvements via Ex Post Verifiable Commitments
by: Sauerberg, Nathaniel, et al.
Published: (2025)

Finding equilibria: simpler for pessimists, simplest for optimists
by: Brice, Léonard, et al.
Published: (2025)

Pareto and Bowley Reinsurance Games in Peer-to-Peer Insurance
by: Boonen, Tim J., et al.
Published: (2026)

Finding Possible Winners in Spatial Voting with Incomplete Information
by: Shachnai, Hadas, et al.
Published: (2025)

Repositioning, Ride-matching, and Abandonment in On-demand Ride-hailing Platforms: A Mean Field Game Approach
by: Li, Yunpeng, et al.
Published: (2025)

A decomposition from a many-to-one matching market with path-independent choice functions to a one-to-one matching market
by: Neme, Pablo, et al.
Published: (2024)

Pairwise efficiency and monotonicity imply Pareto efficiency in (probabilistic) object allocation
by: Demeulemeester, Tom, et al.
Published: (2025)

Condorcet Dimension and Pareto Optimality for Matchings and Beyond
by: Kavitha, Telikepalli, et al.
Published: (2026)

Constraint-Aware Generative Auto-bidding via Pareto-Prioritized Regret Optimization
by: Wu, Binglin, et al.
Published: (2026)

Popularity and Perfectness in One-sided Matching Markets with Capacities
by: Csáji, Gergely
Published: (2024)

Adaptive Two-sided Assortment Optimization: Revenue Maximization
by: Ahmadnejadsaein, Mohammadreza, et al.
Published: (2025)

Smart Lotteries in School Choice: Ex-ante Pareto-Improvement with Ex-post Stability
by: Aziz, Haris, et al.
Published: (2026)

Substitutability, equilibrium transport, and matching models
by: Galichon, Alfred, et al.
Published: (2024)

Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game
by: Maiti, Arnab, et al.
Published: (2023)

From signaling to interviews in random matching markets
by: Allman, Maxwell, et al.
Published: (2025)

Algorithmic collusion in a two-sided market: A rideshare example
by: Koirala, Pravesh, et al.
Published: (2024)

Testing popularity in linear time via maximum matching
by: Bérczi-Kovács, Erika, et al.
Published: (2023)

Envy-Free and Pareto-Optimal Allocations for Agents with Asymmetric Random Valuations
by: Bai, Yushi, et al.
Published: (2021)

Task Allocation in Customer-led Two-sided Markets with Satellite Constellation Services
by: Qiao, Jianglin, et al.
Published: (2025)

Counting steps for re-stabilization in a labor matching market
by: Bonifacio, Agustin G., et al.
Published: (2024)

Fair and Welfare-Efficient Constrained Multi-matchings under Uncertainty
by: Lobo, Elita, et al.
Published: (2024)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
by: Brânzei, Simina, et al.
Published: (2024)

Optimal Competitive Ratio of Two-sided Online Bipartite Matching
by: Tang, Zhihao Gavin
Published: (2026)

DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information
by: Xin, Yun, et al.
Published: (2025)

A market-based efficient matching mechanism for crowdsourced delivery systems with demand/supply elasticities
by: Oyama, Yuki, et al.
Published: (2024)

On Truthful Mechanisms without Pareto-efficiency: Characterizations and Fairness
by: Babaioff, Moshe, et al.
Published: (2024)

Side-by-side first-price auctions with imperfect bidders
by: Heymann, Benjamin
Published: (2025)