Similar Search Results

Ashlagi, Itai; Burq, Maximilien; Dutta, Chinmoy; … - In: Mathematics of operations research 48 (2023) 2, pp. 999-1016

Persistent link: https://www.econbiz.de/10014314971

Frosio, Giancarlo - 2020

Artificial Intelligence (AI) is increasingly and pervasively affecting society. AI and algorithms play a relevant role in the Intellectual Property (IP) discourse as well. Tomorrow, algorithms will of course come as creators and innovators but today they are already here as enforcers. Content...

Persistent link: https://www.econbiz.de/10014090993

Online Appendix of 'Steering via Algorithmic Recommendations'

Chen, Nan; Tsai, Hsin-Tien - 2023

Online Appendix of “Steering via Algorithmic Recommendations” Chen and Tsai (2019)This paper studies whether self-preferencing affects algorithmic recommendations on dominant platforms. We focus on the dual role of Amazon.com as a platform owner and retailer. We find that products sold by...

Persistent link: https://www.econbiz.de/10014357591

Online stochastic matching : online actions based on offline statistics

Manshadi, Vahideh H.; Gharan, Shayan Oveis; Saberi, Amin - In: Mathematics of operations research 37 (2012) 4, pp. 559-573

Persistent link: https://www.econbiz.de/10009684091

Best or Right? - Positioning and Authentication in Online Matching Platforms

Basu, Amit - 2020

important consideration, without which a match can be ineffective. Online matching platforms are a useful resource in such … credentials. In this paper, we examine an online matching platform's decisions about whether to offer positioning and … addressed by these services, we show that the choices online matching platforms face about offering them are non-trivial. We …

Persistent link: https://www.econbiz.de/10012830199

Prophet matching with general arrivals

Ezra, Tomer; Feldman, Michal; Gravin, Nick; Tang, … - In: Mathematics of operations research 47 (2022) 2, pp. 878-898

Persistent link: https://www.econbiz.de/10013364974

A Non-Asymptotic Analysis for Re-Solving Heuristic in Online Matching

Wang, Hao; Yan, Zhenzhen; Bei, Xiaohui - 2022

We investigate an online edge-weighted bipartite matching problem with general capacity constraints. In this problem … the offline linear program. We analyze the performance guarantee of each algorithm in terms of its competitive ratio … offline solution to guide the online algorithm decisions. We find that the algorithm’s competitive ratio can be significantly …

Persistent link: https://www.econbiz.de/10014085546

Driving supply to marketplaces : optimal platform pricing when suppliers share inventory

Martínez-de-Albéniz, Victor; Pinto, Catarina; Amorim, … - In: Manufacturing & service operations management : M & SOM 24 (2022) 4, pp. 2367-2386

Persistent link: https://www.econbiz.de/10013373556

Assortment optimization under the multinomial logit model with utility-based rank cutoffs

Bai, Yicheng; Feldman, Jacob; Topaloğlu, Hüseyin; … - In: Operations research 72 (2024) 4, pp. 1453-1474

Persistent link: https://www.econbiz.de/10015045389

Technical note: greedy algorithm for multiway matching with bounded regret

Gupta, Varun - In: Operations research 72 (2024) 3, pp. 1139-1155

Persistent link: https://www.econbiz.de/10014557555