More Like this

1. Decentralized Fictitious Play Converges Near a Nash Equilibrium in Near-Potential Games

   https://doi.org/10.1109/IEEECONF53345.2021.9723397  

   Aydin, Sarper; Arefizadeh, Sina; Eksin, Ceyhun (October 2021, 2021 55th Asilomar Conference on Signals, Systems, and Computers)
2. Unidirectional kaolinite dissolution rates at near-equilibrium and near-neutral pH conditions

   https://doi.org/10.1016/j.clay.2019.105284  

   Gong, Lei; Rimstidt, J. Donald; Zhang, Yilun; Chen, Kaiyun; Zhu, Chen (December 2019, Applied Clay Science)
3. Near-domination in graphs

   https://doi.org/10.1016/j.jcta.2019.02.009  

   Reed, Bruce; Scott, Alex; Seymour, Paul (July 2019, Journal of Combinatorial Theory, Series A)
4. Rational Exponents Near Two

   https://doi.org/10.19086/aic.2022.9  

   Conlon, David; Janzer, Oliver (January 2022, Advances in Combinatorics)

   A longstanding conjecture of Erdos and Simonovits states that for every rational r between 1 and 2 there is a graph H such that the largest number of edges in an H-free graph on n vertices is \Theta(n^r). Answering a question raised by Jiang, Jiang and Ma, we show that the conjecture holds for all rationals of the form 2-a/b with b sufficiently large in terms of a. 

   more » « less
5. On Near Perfect Numbers

   Peter Cohen, Katherine Cordwell (January 2020, Acta Arithmetica)

   null (Ed.)