Zobrazeno 1 - 10
of 229
pro vyhledávání: '"Asuman Ozdaglar"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 3 (2017)
We introduce a new class of (dynamical) systems that inherently capture cascading effects (viewed as consequential effects) and are naturally amenable to combinations. We develop an axiomatic general theory around those systems, and guide the endeavo
Externí odkaz:
https://doaj.org/article/2cc335cb42ea49569194c27d5b18a964
Publikováno v:
IEEE Transactions on Signal Processing. 70:2136-2151
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97155e34f59eb7e534e9a85982ec0f16
https://doi.org/10.1109/tsp.2022.3160277
https://doi.org/10.1109/tsp.2022.3160277
Publikováno v:
Econometrica. 90:2857-2899
This paper develops a model of Bayesian learning from online reviews and investigates the conditions for learning the quality of a product and the speed of learning under different rating systems. A rating system provides information about reviews le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cfe2e35df60c08a4554d9065094ae69
https://doi.org/10.3982/ecta15847
https://doi.org/10.3982/ecta15847
Publikováno v:
Mathematical Programming. 195:243-281
Semidefinite programming (SDP) with diagonal constraints arise in many optimization problems, such as Max-Cut, community detection and group synchronization. Although SDPs can be solved to arbitrary precision in polynomial time, generic convex solver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f11ca875daaddbfd1fc8fc2d803460c
https://doi.org/10.1007/s10107-021-01686-3
https://doi.org/10.1007/s10107-021-01686-3
We consider a platform's problem of collecting data from privacy sensitive users to estimate an underlying parameter of interest. We formulate this question as a Bayesian-optimal mechanism design problem, in which an individual can share her (verifia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5bfc9b28760ab2c057d55756e994027
We present a model of online content sharing where agents sequentially observe an article and must decide whether to share it with others. The article may contain misinformation, but at a cost, agents can fact-check it to determine whether its conten
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b0632e7e5610a01c472eba04e73512b
https://doi.org/10.3386/w28884
https://doi.org/10.3386/w28884
Publikováno v:
Springer Berlin Heidelberg
We consider coordinate descent (CD) methods with exact line search on convex quadratic problems. Our main focus is to study the performance of the CD method that use random permutations in each epoch and compare it to the performance of the CD method
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4273a0807cfa5e03929d1dd3d66094f
https://doi.org/10.1007/s10107-019-01438-4
https://doi.org/10.1007/s10107-019-01438-4
Publikováno v:
IEEE Transactions on Automatic Control. 64:1890-1904
We characterize the role played by memory when linear time-invariant systems interact. This study is of interest as the phenomenon that occurs in this setting is arguably the same phenomenon that governs some cascading failure and contagion effects i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a772b788e7638e187cf4bac71ac09b5e
https://doi.org/10.1109/tac.2018.2873353
https://doi.org/10.1109/tac.2018.2873353
Publikováno v:
SIAM Journal on Optimization. 29:2542-2565
The incremental gradient (IG) method is a prominent algorithm for minimizing a finite sum of smooth convex functions and is used in many contexts including large-scale data processing applications ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed1424bbc0cb40e6702f0865f4238b11
https://doi.org/10.1137/17m1147846
https://doi.org/10.1137/17m1147846