Cover Image

Optimal Stopping with Interdependent Values

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mauras, Simon, Mohan, Divyarthi, Reiffenhäuser, Rebecca
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Combinatorial Allocation with Interdependent Values
by: Feldman, Michal, et al.
Published: (2025)

Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids
by: Eden, Alon, et al.
Published: (2024)

Truthful Matching with Online Items and Offline Agents
by: Feldman, Michal, et al.
Published: (2022)

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

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

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

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

Algorithmically Fair Maximization of Multiple Submodular Objective Functions
by: Amanatidis, Georgios, et al.
Published: (2024)

Online Combinatorial Allocations and Auctions with Few Samples
by: Dütting, Paul, et al.
Published: (2024)

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

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

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

Optimal Pricing with Unreliable Signals
by: Tang, Zhihao Gavin, et al.
Published: (2026)

Robust Value Maximization in Challenge the Champ Tournaments with Probabilistic Outcomes
by: Bhaskar, Umang, et al.
Published: (2026)

Optimal Capacity Modification for Stable Matchings with Ties
by: Ranjan, Keshav, et al.
Published: (2024)

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

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

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

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

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

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

Truthful, Credible, and Optimal Auctions for Matroids via Blockchains and Commitments
by: Ganesh, Aadityan, et al.
Published: (2025)

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

Individual Rationality in Topological Distance Games is Surprisingly Hard
by: Deligkas, Argyrios, et al.
Published: (2024)

Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
by: Cheng, Christine T., et al.
Published: (2026)

Maximizing Value in Challenge the Champ Tournaments
by: Bhaskar, Umang, 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)

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

Budget-feasible Egalitarian Allocation of Conflicting Jobs
by: Gupta, Sushmita, et al.
Published: (2024)

Randomized Binary and Tree Search under Pressure
by: Caracci, Agustín, et al.
Published: (2024)

A Little Aggression Goes a Long Way
by: Krishnan, Jyothi, et al.
Published: (2024)

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

Online Matroid Embeddings
by: Cristi, Andrés, et al.
Published: (2024)

When far is better: The Chamberlin-Courant approach to obnoxious committee selection
by: Gupta, Sushmita, et al.
Published: (2024)

Setting Targets is All You Need:Improved Order Competitive Ratio for Online Selection
by: Chen, Liyan, et al.
Published: (2024)

Metric Distortion of Line-up Elections: The Right Person for the Right Job
by: Jerrett, Christopher, et al.
Published: (2024)

Designing Exploration Contracts
by: Hoefer, Martin, et al.
Published: (2024)

Group Fairness and Multi-criteria Optimization in School Assignment
by: A., Santhini K., et al.
Published: (2024)

Lipschitz Continuous Allocations for Optimization Games
by: Kumabe, Soh, et al.
Published: (2024)