Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Sondjaja, Mutiara"'
In the system of approval voting, individuals vote for all candidates they find acceptable. Many approval voting situations can be modeled geometrically, and thus geometric concepts such as the piercing number have a natural interpretation. In this p
Externí odkaz:
http://arxiv.org/abs/2008.01749
Autor:
De Veaux, Richard, Agarwal, Mahesh, Averett, Maia, Baumer, Benjamin, Bray, Andrew, Bressoud, Thomas, Bryant, Lance, Cheng, Lei, Francis, Amanda, Gould, Robert, Kim, Albert Y., Kretchmar, Matt, Lu, Qin, Moskol, Ann, Nolan, Deborah, Pelayo, Roberto, Raleigh, Sean, Sethi, Ricky J., Sondjaja, Mutiara, Tiruviluamala, Neelesh, Uhlig, Paul, Washington, Talitha, Wesley, Curtis, White, David, Ye, Ping
Publikováno v:
Annual Review of Statistics, Volume 4 (2017), 15-30
The Park City Math Institute (PCMI) 2016 Summer Undergraduate Faculty Program met for the purpose of composing guidelines for undergraduate programs in Data Science. The group consisted of 25 undergraduate faculty from a variety of institutions in th
Externí odkaz:
http://arxiv.org/abs/1801.06814
Publikováno v:
The American Mathematical Monthly, 125 (2018) 29-43
In approval voting, individuals vote for all platforms that they find acceptable. In this situation it is natural to ask: When is agreement possible? What conditions guarantee that some fraction of the voters agree on even a single platform? Berg et.
Externí odkaz:
http://arxiv.org/abs/1703.09870
Publikováno v:
Math Horizons; 2024, Vol. 32 Issue 1, p8-11, 4p
Sperner's lemma is a statement about labeled triangulations of a simplex. McLennan and Tourky (2007) provided a novel proof of Sperner's Lemma by examining volumes of simplices in a triangulation under time-linear simplex-linear deformation. We adapt
Externí odkaz:
http://arxiv.org/abs/1604.02395
Autor:
Renegar, James, Sondjaja, Mutiara
We develop a natural variant of Dikin's affine-scaling method, first for semidefinite programming and then for hyperbolic programming in general. We match the best complexity bounds known for interior-point methods. All previous polynomial-time affin
Externí odkaz:
http://arxiv.org/abs/1410.6734
Publikováno v:
The American Mathematical Monthly, 2018 Jan 01. 125(1), 29-43.
Externí odkaz:
https://www.jstor.org/stable/48661221
Autor:
Sondjaja, Mutiara
Publikováno v:
HMC Senior Theses.
Kakutani’s fixed point theorem has many applications in economics and game theory. One of its most well known applications is in John Nash’s paper [8], where the theorem is used to prove the existence of an equilibrium strategy in n-person games.
Autor:
De Veaux, Richard D., Agarwal, Mahesh, Averett, Maia, Baumer, Benjamin S., Bray, Andrew, Bressoud, Thomas C., Bryant, Lance, Cheng, Lei Z., Francis, Amanda, Gould, Robert, Kim, Albert Y., Kretchmar, Matt, Lu, Qin, Moskol, Ann, Nolan, Deborah, Pelayo, Roberto, Raleigh, Sean, Sethi, Ricky J., Sondjaja, Mutiara, Tiruviluamala, Neelesh
Publikováno v:
Annual Review of Statistics & Its Application; Mar2017, Vol. 4, p15-30, 11p