output
20092022
most citedFlower Pollination Algorithm: A Novel Approach for Multiobjective Optimization

626 citations

6 papers

cs.GT2022★ 75 cited

From Outcome-Based to Language-Based Preferences

Valerio Capraro, Joseph Y. Halpern, Matjaz Perc

We review the literature on models that try to explain human behavior in social interactions described by normal-form games with monetary payoffs. We start by covering social and m…

math.DS2021★ 9 cited

Adding species to chemical reaction networks: preserving rank preserves nondegenerate behaviours

Murad Banaji, Balázs Boros, Josef Hofbauer

We show that adding new chemical species into the reactions of a chemical reaction network (CRN) in such a way that the rank of the network remains unchanged preserves its capacity…

cs.LO2020★ 1 cited

A Game Theoretical Semantics for Logics of Nonsense

Can Başkent

Logics of non-sense allow a third truth value to express propositions that are \emph{nonsense}. These logics are ideal formalisms to understand how errors are handled in programs a…

cs.DM2015

The packing chromatic number of the infinite square lattice is between 13 and 15

Barnaby Martin, Franco Raimondi, Taolue Chen +1

Using a SAT-solver on top of a partial previously-known solution we improve the upper bound of the packing chromatic number of the infinite square lattice from 17 to 15. We discuss…

math.OC2014★ 626 cited

Flower Pollination Algorithm: A Novel Approach for Multiobjective Optimization

Xin-She Yang, M. Karamanoglu, X. S. He

Multiobjective design optimization problems require multiobjective optimization techniques to solve, and it is often very challenging to obtain high-quality Pareto fronts accuratel…

math.RA2009★ 1 cited

Examples of associative algebras for which the T-space of central polynomials is not finitely based

C. Bekh-Ochir, S. A. Rankin

In 1988, S. V. Okhitin proved that for any field k of characteristic zero, the T-space CP(M_2(k)) is finitely based, and he raised the question as to whether CP(A) is finitely base…