The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In parliaments elected by proportional systems the seats are allocated to the elected political parties roughly proportionally to the shares of votes for the party lists. Assuming that members
of the parliament representing the same party are voting together, it has sense to require that distribution of the influence of the parties in parliamentary decision making is proportional to the distribution of seats. There exist measures (so called voting power indices) reflecting an ability of each party...
The computation of leastcore and prenucleolus is an efficient way of
allocating a common resource among n players. It has, however,
the drawback being a linear programming problem with
2n - 2 constraints. In this paper we show
how, in the case of convex production games,
generate constraints by solving small size
linear programming problems,
with both continuous and integer variables.
The approach is extended to games with symmetries (identical players),
and to games with partially continuous...
A well-known result in public economics is that capital income should not be taxed in the long run. This result has been derived using necessary optimality conditions for an appropriate dynamic Stackelberg game. In this paper we consider three models of dynamic taxation in continuous time and suggest a method for calculating their feedback Nash equilibria based on a sufficient condition for optimality. We show that the optimal tax on capital income is generally different from zero.
We continue the efforts to characterize winning strategies in various infinite games involving filters on the natural numbers in terms of combinatorial or structural properties of the given filter. Previous results in the literature included those games where player II responded with natural numbers, or finite subsets of natural numbers. In this paper we concentrate on games where player II responds with members of the dual ideal. We also give a summary of known results on filter games.
Drawing on an analogy with temporal fixpoint logic, we relate the arithmetic fixpoint definable sets to the winning positions of certain games, namely games whose winning conditions lie in the difference hierarchy over . This both provides a simple characterization of the fixpoint hierarchy, and refines existing results on the power of the game quantifier in descriptive set theory. We raise the problem of transfinite fixpoint hierarchies.
Drawing on an analogy with temporal fixpoint logic, we relate the
arithmetic fixpoint definable sets to the winning positions of certain
games, namely games whose winning conditions lie in the difference
hierarchy over . This both provides a simple characterization
of the fixpoint hierarchy, and refines existing results on the power of
the game quantifier in descriptive set theory. We raise the problem of
transfinite fixpoint hierarchies.
Interests in Closed-Loop Supply Chain (CLSC) issues are growing day by day within the academia, companies, and customers. Many papers discuss profitability or cost reduction impacts of remanufacturing, but a very important point is almost missing. Indeed, there is no guarantee about the amounts of return products even if we know a lot about demands of first products. This uncertainty is due to reasons such as companies' capabilities in collecting End-of-Life (EOL) products, customers' interests...
Dans cet article, nous présentons les aspects essentiels de la modélisation du processus décisionnel des joueurs de tennis dans une phase particulière de ce jeu sportif : le service-retour. Notre démarche se focalise sur la représentation des connaissances s'exerçant dans un continuum temporel scindé en micro-cycles et sur la construction de structures permettant d'envisager l'auto-apprentissage des caractéristiques technico-tactiques des joueurs par le système. Elle s'appuie sur la mise en oeuvre...
Currently displaying 1 –
20 of
46