:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Berger, Andre, Rouhani, Arman, Schröder, Marc
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computer Science and Game Theory
Accesso online:	https://arxiv.org/abs/2401.05740
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Bayes correlated equilibria, no-regret dynamics in Bayesian games, and the price of anarchy
di: Fujii, Kaito
Pubblicazione: (2023)

The power of mediators: Price of anarchy and stability in Bayesian games with submodular social welfare
di: Fujii, Kaito
Pubblicazione: (2025)

Popularity in location games
di: Fournier, Gaëtan, et al.
Pubblicazione: (2024)

Interval Scheduling Games
di: Vijayalakshmi, Vipin Ravindran, et al.
Pubblicazione: (2026)

No-Regret Online Autobidding Algorithms in First-price Auctions
di: Deng, Yuan, et al.
Pubblicazione: (2025)

Nash Flows Over Time with Tolls
di: Rosner, Shaul, et al.
Pubblicazione: (2025)

On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX
di: Mortazavi, Ali, et al.
Pubblicazione: (2024)

A flow-based ascending auction to compute buyer-optimal Walrasian prices
di: Eickhoff, Katharina, et al.
Pubblicazione: (2023)

Bounds on the revenue gap of linear posted pricing for selling a divisible item
di: Caragiannis, Ioannis, et al.
Pubblicazione: (2020)

Sharing delay costs in stochastic scheduling problems with delays
di: Gonçalves-Dosantos, J. C., et al.
Pubblicazione: (2024)

Algorithmic pricing with independent learners and relative experience replay
di: Han, Bingyan
Pubblicazione: (2021)

Stronger core results with multidimensional prices
di: Braverman, Mark, et al.
Pubblicazione: (2026)

OpenAlpha: A Community-Led Adversarial Strategy Validation Mechanism for Decentralised Capital Management
di: Abgaryan, Arman, et al.
Pubblicazione: (2025)

Network Creation Games with 2-Neighborhood Maximization
di: de la Haye, Merlin, et al.
Pubblicazione: (2025)

Improved learning rates in multi-unit uniform price auctions
di: Potfer, Marius, et al.
Pubblicazione: (2025)

An efficiency ordering of k-price auctions under complete information
di: Goel, Sumit, et al.
Pubblicazione: (2025)

Learning-Augmented Metric Distortion via $(p,q)$-Veto Core
di: Berger, Ben, et al.
Pubblicazione: (2023)

Branch-and-price with novel cuts, and a new Stackelberg Security Game
di: Bustamante-Faúndez, Pamela, et al.
Pubblicazione: (2024)

Economic Censorship Games in Fraud Proofs
di: Berger, Ben, et al.
Pubblicazione: (2025)

Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
di: Han, Yanjun, et al.
Pubblicazione: (2020)

Strategic Network Creation for Enabling Greedy Routing
di: Berger, Julian, et al.
Pubblicazione: (2024)

A new lower bound for multi-color discrepancy with applications to fair division
di: Caragiannis, Ioannis, et al.
Pubblicazione: (2025)

Learning in Games with Progressive Hiding
di: Heymann, Benjamin, et al.
Pubblicazione: (2024)

Collective schedules: axioms and algorithms
di: Durand, Martin, et al.
Pubblicazione: (2024)

Optimal No-regret Learning in Repeated First-price Auctions
di: Han, Yanjun, et al.
Pubblicazione: (2020)

An upper bound for the number of chess diagrams without promotion
di: Gourion, Daniel
Pubblicazione: (2021)

Selfish routing games with priority lanes
di: Li, Yang, et al.
Pubblicazione: (2026)

The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions
di: Wen, Yuxiao, et al.
Pubblicazione: (2026)

Position: Machine Learning for Heart Transplant Allocation Policy Optimization Should Account for Incentives
di: Anagnostides, Ioannis, et al.
Pubblicazione: (2026)

Properties of Winning Iterated Prisoner's Dilemma Strategies
di: Glynatsi, Nikoleta E., et al.
Pubblicazione: (2020)

Side-by-side first-price auctions with imperfect bidders
di: Heymann, Benjamin
Pubblicazione: (2025)

Reviving, reproducing, and revisiting Axelrod's second tournament
di: Knight, Vincent, et al.
Pubblicazione: (2025)

Lower bounds for ranking-based pivot rules
di: Disser, Yann, et al.
Pubblicazione: (2025)

Computational bounds on randomized algorithms for online bin stretching
di: Lhomme, Antoine, et al.
Pubblicazione: (2024)

Improved lower bounds for the maximum size of Condorcet domains
di: Karpov, Alexander, et al.
Pubblicazione: (2026)

Study and improvement of search algorithms in two-players perfect information games
di: Cohen-Solal, Quentin
Pubblicazione: (2025)

An explainable machine learning-based approach for analyzing customers' online data to identify the importance of product attributes
di: Karimzadeh, Aigin, et al.
Pubblicazione: (2024)

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

Optimal bounds for dissatisfaction in perpetual voting
di: Kozachinskiy, Alexander, et al.
Pubblicazione: (2024)

Predicting human decisions with behavioral theories and machine learning
di: Plonsky, Ori, et al.
Pubblicazione: (2019)