Zobrazeno 1 - 10
of 175
pro vyhledávání: '"A. A. Gravin"'
The facility location with strategic agents is a canonical problem in the literature on mechanism design without money. Recently, Agrawal et. al. considered this problem in the context of machine learning augmented algorithms, where the mechanism des
Externí odkaz:
http://arxiv.org/abs/2410.07497
Motivated by practical concerns in the online advertising industry, we study a bidder subset selection problem in single-item auctions. In this problem, a large pool of candidate bidders have independent values sampled from known prior distributions.
Externí odkaz:
http://arxiv.org/abs/2211.10969
Publikováno v:
SAGT (2022) Algorithmic Game Theory 60-77
A Lookahead Auction (LA), introduced by Ronen, is an auction format for the sale of a single item among multiple buyers, which is considered simpler and more fair than the optimal auction. Indeed, it anonymously selects a provisional winner by a symm
Externí odkaz:
http://arxiv.org/abs/2209.12934
In a single-parameter mechanism design problem, a provider is looking to sell a service to a group of potential buyers. Each buyer $i$ has a private value $v_i$ for receiving the service and a feasibility constraint restricts which sets of buyers can
Externí odkaz:
http://arxiv.org/abs/2202.09291
We introduce a new measure for the performance of online algorithms in Bayesian settings, where the input is drawn from a known prior, but the realizations are revealed one-by-one in an online fashion. Our new measure is called order-competitive rati
Externí odkaz:
http://arxiv.org/abs/2202.09215
Autor:
Ignacio Alberto Concha-Eastman, José Gravin Fernández Quintero, Sandra Elena Pineda Ospina, Edgar Iván Ortiz Lizcano, Mauricio Hernández Carrillo
Publikováno v:
Interdisciplinary Journal of Epidemiology and Public Health, Vol 7, Iss 2 (2024)
Introducción: El control prenatal (CPN) sirve para identificar riesgos en la embarazada con la finalidad de intervenirlos para llevar una gestación a término y sin complicaciones. Objetivo: Determinar si la clasificación del riesgo obstétrico
Externí odkaz:
https://doaj.org/article/8016ef2171ae446d84be759d456c68b7
We provide online algorithms for secretary matching in general weighted graphs, under the well-studied models of vertex and edge arrivals. In both models, edges are associated with arbitrary weights that are unknown from the outset, and are revealed
Externí odkaz:
http://arxiv.org/abs/2011.01559
We provide prophet inequality algorithms for online weighted matching in general (non-bipartite) graphs, under two well-studied arrival models, namely edge arrival and vertex arrival. The weight of each edge is drawn independently from an a-priori kn
Externí odkaz:
http://arxiv.org/abs/2002.09807
Several fairness concepts have been proposed recently in attempts to approximate envy-freeness in settings with indivisible goods. Among them, the concept of envy-freeness up to any item (EFX) is arguably the closest to envy-freeness. Unfortunately,
Externí odkaz:
http://arxiv.org/abs/1902.04319
Autor:
Artryom Gravin
Publikováno v:
Вестник Православного Свято-Тихоновского гуманитарного университета: Серия I. Богословие, философия, Vol 104, Iss 104, Pp 153-157 (2022)
Externí odkaz:
https://doaj.org/article/9c4cc2df87384a8da8c0eb85a9a45186