Imagen de Portada

On the Complexity of the Two-Stage Majoritarian Rule

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Yang, Yongjie
Formato:	Preprint
Publicado:	2023
Materias:	Computer Science and Game Theory Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

Complexity of Auctions with Interdependence
por: Loiseau, Patrick, et al.
Publicado: (2026)

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

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

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

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

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

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

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

Combinatorial Stationary Prophet Inequalities
por: Patel, Neel, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

Stability in Online Coalition Formation
por: Bullinger, Martin, et al.
Publicado: (2023)

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

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

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

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

Universal Online Contention Resolution with Preselected Order
por: Zhao, Junyao
Publicado: (2025)

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

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

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

Online Job Assignment
por: Ekbatani, Farbod, et al.
Publicado: (2025)

Near-Feasible Stable Matchings: Incentives and Optimality
por: Glitzner, Frederik
Publicado: (2026)

Additively Competitive Secretaries
por: Mahdian, Mohammad, et al.
Publicado: (2026)

Data Exchange Markets via Utility Balancing
por: Bhaskara, Aditya, et al.
Publicado: (2024)