:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Yang, Yongjie
Format:	Preprint
Published:	2023
Subjects:	Computer Science and Game Theory Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2301.04009
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Parameterized Complexity of Controlling Amendment and Successive Winners
by: Yang, Yongjie
Published: (2025)

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

Fairness and Efficiency in Two-Sided Matching Markets
by: Jain, Pallavi, et al.
Published: (2025)

Efficient Two-Sided Markets with Limited Information
by: Dütting, Paul, et al.
Published: (2020)

Sample Complexity of Posted Pricing for a Single Item
by: Jin, Billy, et al.
Published: (2024)

Envy-Free School Redistricting Between Two Groups
by: Shibatani, Daisuke, et al.
Published: (2026)

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

Pairwise Exchanges of Freely Replicable Goods with Negative Externalities
by: Yang, Shangyuan, et al.
Published: (2026)

Complexity of Auctions with Interdependence
by: Loiseau, Patrick, et al.
Published: (2026)

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

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

Unravelling Expressive Delegations: Complexity and Normative Analysis
by: Tyrovolas, Giannis, et al.
Published: (2023)

On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
by: Koenemann, Jochen, et al.
Published: (2021)

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
by: Anagnostides, Ioannis, et al.
Published: (2023)

Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs
by: Kawase, Sota, et al.
Published: (2024)

Smooth Nash Equilibria: Algorithms and Complexity
by: Daskalakis, Constantinos, et al.
Published: (2023)

Pandora's Problem with Combinatorial Cost
by: Berger, Ben, et al.
Published: (2023)

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
by: Constantinescu, Andrei, et al.
Published: (2023)

Threshold Testing and Semi-Online Prophet Inequalities
by: Hoefer, Martin, et al.
Published: (2023)

How to Make Knockout Tournaments More Popular?
by: Chaudhary, Juhi, et al.
Published: (2023)

Combinatorial Stationary Prophet Inequalities
by: Patel, Neel, et al.
Published: (2023)

Threshold Policies with Tight Guarantees for Online Selection with Convex Costs
by: Tan, Xiaoqi, et al.
Published: (2023)

Addressing Bias in Online Selection with Limited Budget of Comparisons
by: Benomar, Ziyad, et al.
Published: (2023)

Beyond the worst case: Distortion in impartial culture electorates
by: Caragiannis, Ioannis, et al.
Published: (2023)

Laminar Matroid Secretary: Greedy Strikes Back
by: Huang, Zhiyi, et al.
Published: (2023)

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods
by: Kawase, Yasushi, et al.
Published: (2023)

Online Coalition Formation under Random Arrival or Coalition Dissolution
by: Bullinger, Martin, et al.
Published: (2023)

Static Pricing Guarantees for Queueing Systems
by: Bergquist, Jacob, et al.
Published: (2023)

Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings
by: V., Vishwa Prakash H., et al.
Published: (2023)

Stability in Online Coalition Formation
by: Bullinger, Martin, et al.
Published: (2023)

Optimally Interpolating between Ex-Ante Fairness and Welfare
by: Høgsgaard, Mikael Møller, et al.
Published: (2023)

A Reduction from Chores Allocation to Job Scheduling
by: Huang, Xin, et al.
Published: (2023)

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

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

Universal Online Contention Resolution with Preselected Order
by: Zhao, Junyao
Published: (2025)

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

Matching with Nested and Bundled Pandora Boxes
by: Bowers, Robin, et al.
Published: (2024)

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

Online Job Assignment
by: Ekbatani, Farbod, et al.
Published: (2025)

Near-Feasible Stable Matchings: Incentives and Optimality
by: Glitzner, Frederik
Published: (2026)