Copertina

What Do Our Choices Say About Our Preferences?

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Grining, Krzysztof, Klonowski, Marek, Sulkowska, Małgorzata
Natura:	Preprint
Pubblicazione:	2020
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Finding One Local Optimum Is Easy -- but What About Two?
di: Kobayashi, Yasuaki, et al.
Pubblicazione: (2025)

Multiway Cuts with a Choice of Representatives
di: Bérczi, Kristóf, et al.
Pubblicazione: (2024)

A Refutation of Elmasry's $\tilde{O}(m \sqrt{n})$-Time Algorithm for Single-Source Shortest Paths
di: Atalig, Sunny, et al.
Pubblicazione: (2025)

Optimal Algorithms for Free Order Multiple-Choice Secretary
di: Hajiaghayi, Mohammad Taghi, et al.
Pubblicazione: (2022)

Fast decremental tree sums in forests
di: Berendsohn, Benjamin Aram, et al.
Pubblicazione: (2026)

Dynamic Parameterized Feedback Problems in Tournaments
di: Zych-Pawlewicz, Anna, et al.
Pubblicazione: (2024)

Speed Thrills: Visceral Demonstrations That Get Students Excited About Efficient Algorithms
di: Moffat, Alistair, et al.
Pubblicazione: (2026)

Blocked Bloom Filters with Choices
di: Schmitz, Johanna Elena, et al.
Pubblicazione: (2025)

Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP
di: Karczmarz, Adam, et al.
Pubblicazione: (2025)

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
di: Borst, Sander, et al.
Pubblicazione: (2024)

Robust Streaming Against Low-Memory Adversaries
di: Ben-Eliezer, Omri, et al.
Pubblicazione: (2025)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
di: Andoni, Alexandr, et al.
Pubblicazione: (2026)

Fully dynamic biconnectivity in $\tilde{\mathcal{O}}(\log^2 n)$ time
di: Holm, Jacob, et al.
Pubblicazione: (2025)

Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties
di: Matsui, Tomomi, et al.
Pubblicazione: (2016)

Fair Committee Selection under Ordinal Preferences and Limited Cardinal Information
di: Gadekar, Ameet, et al.
Pubblicazione: (2025)

Dynamic PageRank: Algorithms and Lower Bounds
di: Jayaram, Rajesh, et al.
Pubblicazione: (2024)

Clustering What Matters in Constrained Settings
di: Jaiswal, Ragesh, et al.
Pubblicazione: (2023)

Dynamic Detours
di: Dadush, Daniel, et al.
Pubblicazione: (2026)

Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
di: Atalig, Sunny, et al.
Pubblicazione: (2024)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
di: Basiak, Mateusz, et al.
Pubblicazione: (2025)

Two Complexity Results on Spanning-Tree Congestion Problems
di: Atalig, Sunny, et al.
Pubblicazione: (2026)

Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
di: Choromanski, Krzysztof, et al.
Pubblicazione: (2026)

Online Graph Balancing and the Power of Two Choices
di: Bansal, Nikhil, et al.
Pubblicazione: (2026)

Generalized Top-k Mallows Model for Ranked Choices
di: Haddadan, Shahrzad, et al.
Pubblicazione: (2025)

When Location Shapes Choice: Placement Optimization of Substitutable Products
di: Housni, Omar El, et al.
Pubblicazione: (2023)

Algorithms for Caching and MTS with reduced number of predictions
di: Sadek, Karim Abdel, et al.
Pubblicazione: (2024)

Tight Localizations of Feedback Sets
di: Hecht, Michael, et al.
Pubblicazione: (2020)

Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs
di: Duraj, Lech, et al.
Pubblicazione: (2023)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
di: Sun, Shuo, et al.
Pubblicazione: (2024)

Treedepth Inapproximability and Exponential ETH Lower Bound
di: Bonnet, Édouard, et al.
Pubblicazione: (2025)

How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing
di: Kallaugher, John, et al.
Pubblicazione: (2024)

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
di: Zhai, Jianing, et al.
Pubblicazione: (2019)

On Permutation Selectors and their Applications in Ad-Hoc Radio Networks Protocols
di: Kuschner, Jordan, et al.
Pubblicazione: (2024)

Approximation Algorithms for Combinatorial Optimization with Predictions
di: Antoniadis, Antonios, et al.
Pubblicazione: (2024)

Learning-Augmented Algorithms with Explicit Predictors
di: Elias, Marek, et al.
Pubblicazione: (2024)

On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps
di: Clark, Emily, et al.
Pubblicazione: (2024)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
di: Korhonen, Tuukka, et al.
Pubblicazione: (2024)

Self-referential instances of the dominating set problem are irreducible
di: Zhou, Guangyan
Pubblicazione: (2026)

Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
di: Liu, Junfeng, et al.
Pubblicazione: (2025)

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