On pebbling graphs by their blocks.
Curtis, Dawn, Hines, Taylor, Hurlbert, Glenn, Moyer, Tatiana (2009)
Integers
Jan Hanák (1974)
Archivum Mathematicum
Jan Hanák (1973)
Archivum Mathematicum
J. Stahl (1971)
Applicationes Mathematicae
Levitin, E., Tichatschke, R. (1998)
Journal of Convex Analysis
R. Branzei (2008)
Boletín de Estadística e Investigación Operativa. BEIO
Kane, Daniel M. (2010)
Integers
Szymon Plewik (1996)
Colloquium Mathematicae
We present a negative answer to problem 3.7(b) posed on page 193 of [2], where, in fact, A. Rosłanowski asked: Does every set of Lebesgue measure zero belong to some Mycielski ideal?
László Zsilinszky (2013)
Colloquium Mathematicae
Answering a question of Telgársky in the negative, it is shown that there is a space which is β-favorable in the strong Choquet game, but all of its nonempty -subspaces are of the second category in themselves.
Chiarella, Carl, Szidarovszky, Ference (2000)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Leonid N. Vaserstein (1988)
Publicacions Matemàtiques
Some iterative methods of mathematical programming use a damping sequence {αt} such that 0 ≤ αt ≤ 1 for all t, αt → 0 as t → ∞, and Σ αt = ∞. For example, αt = 1/(t+1) in Brown's method for solving matrix games. In this paper, for a model class of iterative methods, the convergence rate for any damping sequence {αt} depending only on time t is computed. The computation is used to find the best damping sequence.
Länger, Helmut (1994)
Mathematica Pannonica
Balogh, József, Samotij, Wojciech (2011)
The Electronic Journal of Combinatorics [electronic only]
Cincotti, Alessandro (2009)
Integers
Josep Freixas, Xavier Molinero, Martin Olsen, Maria Serna (2011)
RAIRO - Operations Research - Recherche Opérationnelle
Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of “yea” votes yield passage of the issue at hand. Each of these collections of “yea” voters forms a winning coalition. We are interested in performing a complexity analysis on problems defined on such families of games. This analysis as usual depends on the game representation...
Josep Freixas, Xavier Molinero, Martin Olsen, Maria Serna (2012)
RAIRO - Operations Research
Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of “yea” votes yield passage of the issue at hand. Each of these collections of “yea” voters forms a winning coalition. We are interested in performing a complexity analysis on problems defined on such families of games....
Katarína Cechlárová (2009)
Kybernetika
In the Shapley-Scarf economy each agent is endowed with one unit of an indivisible good (house) and wants to exchange it for another, possibly the most preferred one among the houses in the market. In this economy, core is always nonempty and a core allocation can be found by the famous Top Trading Cycles algorithm. Recently, a modification of this economy, containing Q >= 2 types of goods (say, houses and cars for Q=2) has been introduced. We show that if the number of agents is 2, a complete...
Antonín Otáhal (1979)
Kybernetika
J. Gordesch (1972)
Metrika
Zoli, Enrico (2004)
Georgian Mathematical Journal