Imagen de Portada

Beyond matroids: Secretary Problem and Prophet Inequality with general constraints

Fuente: arXiv

Guardado en:

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

Ejemplares similares

Secretary, Prophet, and Stochastic Probing via Big-Decisions-First
por: Rubinstein, Aviad, et al.
Publicado: (2026)

Optimal Single-Choice Prophet Inequalities from Samples
por: Rubinstein, Aviad, et al.
Publicado: (2019)

Prophet and Secretary at the Same Time
por: Kehne, Gregory, et al.
Publicado: (2025)

Prophet Secretary and Matching: the Significance of the Largest Item
por: Chen, Ziyun, et al.
Publicado: (2024)

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

Prophet Inequalities with Cancellation Costs
por: Ekbatani, Farbod, et al.
Publicado: (2024)

Multi-Unit Combinatorial Prophet Inequalities
por: Chawla, Shuchi, et al.
Publicado: (2025)

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

The Secretary Problem with Predicted Additive Gap
por: Braun, Alexander, et al.
Publicado: (2024)

Strategizing against No-Regret Learners in First-Price Auctions
por: Rubinstein, Aviad, et al.
Publicado: (2024)

Single-Sample Prophet Inequalities via Greedy-Ordered Selection
por: Caramanis, Constantine, et al.
Publicado: (2021)

Static Pricing for Single Sample Multi-unit Prophet Inequalities
por: Nuti, Pranav, et al.
Publicado: (2024)

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

Minimization I.I.D. Prophet Inequality via Extreme Value Theory: A Unified Approach
por: Livanos, Vasilis, et al.
Publicado: (2024)

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

The complexity of approximate (coarse) correlated equilibrium for incomplete information games
por: Peng, Binghui, et al.
Publicado: (2024)

Trading Prophets with Initial Capital
por: Azar, Yossi, et al.
Publicado: (2025)

Prophet Inequalities: Competing with the Top $\ell$ Items is Easy
por: Molina, Mathieu, et al.
Publicado: (2024)

Prophet Upper Bounds for Online Matching and Auctions
por: Soto, José, et al.
Publicado: (2024)

Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
por: Liu, Junyan, et al.
Publicado: (2025)

Improved Mechanisms and Prophet Inequalities for Graphical Dependencies
por: Livanos, Vasilis, et al.
Publicado: (2024)

Trading Prophets: How to Trade Multiple Stocks Optimally
por: Rajput, Surbhi, et al.
Publicado: (2025)

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

The Average-Value Allocation Problem
por: Bhawalkar, Kshipra, et al.
Publicado: (2024)

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

Canadian Traveller Problems in Temporal Graphs
por: Bellitto, Thomas, et al.
Publicado: (2024)

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

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

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

Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
por: Glitzner, Frederik, et al.
Publicado: (2025)

Minimum Envy Graphical House Allocation Beyond Identical Valuations
por: Inamdar, Tanmay, et al.
Publicado: (2026)

Static Pricing for Online Selection Problem and its Variants
por: Sun, Bo, et al.
Publicado: (2024)

Beyond Exact Fairness: Envy-Free Incomplete Connected Fair Division
por: S, Ajaykrishnan E, et al.
Publicado: (2025)

Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
por: Glitzner, Frederik, et al.
Publicado: (2024)

Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
por: Segev, Danny, et al.
Publicado: (2020)

Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations
por: Andersen, Martin Jupakkal, et al.
Publicado: (2025)

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

Equilibria, Efficiency, and Inequality in Network Formation for Hiring and Opportunity
por: Dwork, Cynthia, et al.
Publicado: (2024)

The Secretary Problem with Predictions and a Chosen Order
por: Karisani, Helia, et al.
Publicado: (2026)

Pandora's Box Problem With Time Constraints
por: Amanatidis, Georgios, et al.
Publicado: (2024)