Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Shah, Anant A."'
This paper takes a game theoretic approach to the design and analysis of online algorithms and illustrates the approach on the finite-horizon ski-rental problem. This approach allows beyond worst-case analysis of online algorithms. First, we define "
Externí odkaz:
http://arxiv.org/abs/2403.10451
Forecast aggregation combines the predictions of multiple forecasters to improve accuracy. However, the lack of knowledge about forecasters' information structure hinders optimal aggregation. Given a family of information structures, robust forecast
Externí odkaz:
http://arxiv.org/abs/2401.17743
A group of agents each exert effort to produce a joint output, with the complementarities between their efforts represented by a (weighted) network. Under equity compensation, a principal motivates the agents to work by giving them shares of the outp
Externí odkaz:
http://arxiv.org/abs/2308.14717
Autor:
Shah, Anant, Rajkumar, Arun
The classical 'buy or rent' ski-rental problem was recently considered in the setting where multiple experts (such as Machine Learning algorithms) advice on the length of the ski season. Here, robust algorithms were developed with improved theoretica
Externí odkaz:
http://arxiv.org/abs/2104.06050
Autor:
Thelagathoti, Rama Krishna, Mastorakis, Spyridon, Shah, Anant, Bedi, Harkeerat, Shannigrahi, Susmit
In this work we investigate Named Data Networking's (NDN's) architectural properties and features, such as content caching and intelligent packet forwarding, in the context of a Content Delivery Network (CDN) workflows. More specifically, we evaluate
Externí odkaz:
http://arxiv.org/abs/2010.12997
Inter-domain routing is a crucial part of the Internet designed for arbitrary policies, economical models, and topologies. This versatility translates into a substantially complex system that is hard to comprehend. Monitoring the inter-domain routing
Externí odkaz:
http://arxiv.org/abs/1711.02805
This paper develops the theory of mechanism redesign by which an auctioneer can reoptimize an auction based on bid data collected from previous iterations of the auction on bidders from the same market. We give a direct method for estimation of the r
Externí odkaz:
http://arxiv.org/abs/1708.04699
There are currently no requirements (technical or otherwise) that BGP paths must be contained within national boundaries. Indeed, some paths experience international detours, i.e., originate in one country, cross international boundaries and return t
Externí odkaz:
http://arxiv.org/abs/1606.05047
Autor:
Martinho Costa, Márcia, Shah, Anant, Rivens, Ian, Box, Carol, O’Shea, Tuathan, Papaevangelou, Efthymia, Bamber, Jeffrey, ter Haar, Gail
Publikováno v:
In Photoacoustics March 2019 13:53-65
Autor:
Carlton, Anne L., Illendula, Anuradha, Gao, Yan, Llaneza, Danielle C., Boulton, Adam, Shah, Anant, Rajewski, Roger A., Landen, Charles N., Wotton, David, Bushweller, John H.
Publikováno v:
In Gynecologic Oncology May 2018 149(2):350-360