Logarithmic Approximation for Road Pricing on Grids
Fuente:
arXiv
Guardado en:
| Autores principales: | Constantinescu, Andrei, Turko, Andrzej, Wattenhofer, Roger |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Condorcet Winners and Anscombes Paradox Under Weighted Binary Voting
por: Baharav, Carmel, et al.
Publicado: (2025)
por: Baharav, Carmel, et al.
Publicado: (2025)
Byzantine Game Theory: Sun Tzus Boxes
por: Constantinescu, Andrei, et al.
Publicado: (2025)
por: Constantinescu, Andrei, et al.
Publicado: (2025)
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
por: Constantinescu, Andrei, et al.
Publicado: (2023)
por: Constantinescu, Andrei, et al.
Publicado: (2023)
Unravelling Expressive Delegations: Complexity and Normative Analysis
por: Tyrovolas, Giannis, et al.
Publicado: (2023)
por: Tyrovolas, Giannis, et al.
Publicado: (2023)
Polynomial-Time Approximation Schemes via Utility Alignment: Unit-Demand Pricing and More
por: Bowers, Robin, et al.
Publicado: (2025)
por: Bowers, Robin, et al.
Publicado: (2025)
Optimal Pricing with Unreliable Signals
por: Tang, Zhihao Gavin, et al.
Publicado: (2026)
por: Tang, Zhihao Gavin, et al.
Publicado: (2026)
Static Pricing Guarantees for Queueing Systems
por: Bergquist, Jacob, et al.
Publicado: (2023)
por: Bergquist, Jacob, et al.
Publicado: (2023)
Posted Price Mechanisms for Online Allocation with Diseconomies of Scale
por: Jazi, Hossein Nekouyan, et al.
Publicado: (2025)
por: Jazi, Hossein Nekouyan, et al.
Publicado: (2025)
Static Pricing for Online Selection Problem and its Variants
por: Sun, Bo, et al.
Publicado: (2024)
por: Sun, Bo, et al.
Publicado: (2024)
Sample Complexity of Posted Pricing for a Single Item
por: Jin, Billy, et al.
Publicado: (2024)
por: Jin, Billy, et al.
Publicado: (2024)
Static Pricing for Single Sample Multi-unit Prophet Inequalities
por: Nuti, Pranav, et al.
Publicado: (2024)
por: Nuti, Pranav, et al.
Publicado: (2024)
A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
por: Charalampopoulos, Andreas, et al.
Publicado: (2025)
por: Charalampopoulos, Andreas, et al.
Publicado: (2025)
The power of mediators: Price of anarchy and stability in Bayesian games with submodular social welfare
por: Fujii, Kaito
Publicado: (2025)
por: Fujii, Kaito
Publicado: (2025)
Welfare Approximation in Additively Separable Hedonic Games
por: Bullinger, Martin, et al.
Publicado: (2025)
por: Bullinger, Martin, et al.
Publicado: (2025)
An FPTAS for 7/9-Approximation to Maximin Share Allocations
por: Huang, Xin, et al.
Publicado: (2025)
por: Huang, Xin, et al.
Publicado: (2025)
Approximating Nash Social Welfare by Matching and Local Search
por: Garg, Jugal, et al.
Publicado: (2022)
por: Garg, Jugal, et al.
Publicado: (2022)
More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
por: Gupta, Sushmita, et al.
Publicado: (2025)
por: Gupta, Sushmita, et al.
Publicado: (2025)
Beyond the Half-Approximation: Fair and Efficient Online Class Matching
por: Borst, Sander, et al.
Publicado: (2026)
por: Borst, Sander, et al.
Publicado: (2026)
Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
por: Segev, Danny, et al.
Publicado: (2020)
por: Segev, Danny, et al.
Publicado: (2020)
Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
por: Feng, Yuda, et al.
Publicado: (2024)
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)
por: Bei, Xiaohui, et al.
Publicado: (2025)
A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
por: Feng, Yuda, et al.
Publicado: (2024)
por: Feng, Yuda, et al.
Publicado: (2024)
Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations
por: Andersen, Martin Jupakkal, et al.
Publicado: (2025)
por: Andersen, Martin Jupakkal, et al.
Publicado: (2025)
Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
por: Brown, Adam, et al.
Publicado: (2024)
por: Brown, Adam, et al.
Publicado: (2024)
The Price of Justified Representation
por: Elkind, Edith, et al.
Publicado: (2021)
por: Elkind, Edith, et al.
Publicado: (2021)
Approximately Bisubmodular Regret Minimization in Billboard and Social Media Advertising
por: Ali, Dildar, et al.
Publicado: (2025)
por: Ali, Dildar, et al.
Publicado: (2025)
The Limits of Interval-Regulated Price Discrimination
por: Munagala, Kamesh, et al.
Publicado: (2024)
por: Munagala, Kamesh, et al.
Publicado: (2024)
Improved Algorithms for Contextual Dynamic Pricing
por: Tullii, Matilde, et al.
Publicado: (2024)
por: Tullii, Matilde, et al.
Publicado: (2024)
Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs
por: Kawase, Sota, et al.
Publicado: (2024)
por: Kawase, Sota, et al.
Publicado: (2024)
Bandit Sequential Posted Pricing via Half-Concavity
por: Singla, Sahil, et al.
Publicado: (2023)
por: Singla, Sahil, et al.
Publicado: (2023)
Strategizing against No-Regret Learners in First-Price Auctions
por: Rubinstein, Aviad, et al.
Publicado: (2024)
por: Rubinstein, Aviad, et al.
Publicado: (2024)
Learning Optimal Posted Prices for a Unit-Demand Buyer
por: Teng, Yifeng, et al.
Publicado: (2025)
por: Teng, Yifeng, et al.
Publicado: (2025)
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)
Bipartiteness in Progressive Second-Price Multi-Auction Networks with Perfect Substitute
por: Blazek, Jordana, et al.
Publicado: (2025)
por: Blazek, Jordana, et al.
Publicado: (2025)
Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions
por: Golrezaei, Negin, et al.
Publicado: (2024)
por: Golrezaei, Negin, et al.
Publicado: (2024)
Adaptive Discretization against an Adversary: Lipschitz bandits, Dynamic Pricing, and Auction Tuning
por: Podimata, Chara, et al.
Publicado: (2020)
por: Podimata, Chara, et al.
Publicado: (2020)
Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection
por: Anari, Nima, et al.
Publicado: (2018)
por: Anari, Nima, et al.
Publicado: (2018)
Improved MMS Approximations for Few Agent Types
por: Garg, Jugal, et al.
Publicado: (2025)
por: Garg, Jugal, et al.
Publicado: (2025)
Procurement Auctions via Approximately Optimal Submodular Optimization
por: Deng, Yuan, et al.
Publicado: (2024)
por: Deng, Yuan, et al.
Publicado: (2024)
Best of Both Worlds Guarantees for Equitable Allocations
por: Bhaskar, Umang, et al.
Publicado: (2025)
por: Bhaskar, Umang, et al.
Publicado: (2025)
Ejemplares similares
-
Condorcet Winners and Anscombes Paradox Under Weighted Binary Voting
por: Baharav, Carmel, et al.
Publicado: (2025) -
Byzantine Game Theory: Sun Tzus Boxes
por: Constantinescu, Andrei, et al.
Publicado: (2025) -
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
por: Constantinescu, Andrei, et al.
Publicado: (2023) -
Unravelling Expressive Delegations: Complexity and Normative Analysis
por: Tyrovolas, Giannis, et al.
Publicado: (2023) -
Polynomial-Time Approximation Schemes via Utility Alignment: Unit-Demand Pricing and More
por: Bowers, Robin, et al.
Publicado: (2025)