Search results for "Computation"
showing 10 items of 7362 documents
Existence and Optimality of Nash Equilibria in Inventory Games
2005
Abstract This paper studies the stability and optimality of a distributed consensus protocol for n -player repeated non cooperative games under incomplete information. At each stage, the players choose binary strategies and incur in a payoff monotonically decreasing with the number of active players. The game is specialized to an inventory application, where fixed costs are shared among all retailers, interested in whether reordering or not from a common warehouse. The authors focus on Pareto optimality as a measure of coordination of reordering strategies, proving that there exists a unique Pareto optimal Nash equilibrium that verifies certain stability conditions.
Negative results in the theory of games with lexicographic utilities
2003
When players may have lexicographic utilities, there are: (i) extensive games having a non-empty set of equilibria but empty sets of sequentially rational, sequential and perfect equilibria (ii) normal form games having a non-empty set of equilibria but an empty set of proper equilibria and no stable set of equilibria and (iii) two extensive games having the same normal form representation and disjoint sets of sequential equilibria.
Proportional Small Sample Bias in Pricing Kernel Estimations
2014
Numerous empirical studies find pricing kernels that are not-monotonically decreasing; the findings are at odds with the pricing kernel being marginal utility of a risk-averse, so-called representative agent. We study in detail the common procedure which estimates the pricing kernel as the ratio of two separate density estimations. In a first step, we analyze theoretically the functional dependence for the ratio of a density to its estimated density; this cautions the reader of potential computational issues coupled with statistical techniques. In a second step, we study this quantitatively; we show that small sample biases shape the estimated pricing kernel, and that estimated pricing kern…
Heterogeneous network games: Conflicting preferences
2013
Proceeding at: 2nd Annual UECE Lisbon Meeting: Game Theory and Applications, took place 2010, November, 4-6, in Lisbon (Portugal). The event Web site http://pascal.iseg.utl.pt/~uece/lisbonmeetings2010/ In many economic situations, a player pursues coordination or anti-coordination with her neighbors on a network, but she also has intrinsic preferences among the available options. We here introduce a model which allows to analyze this issue by means of a simple framework in which players endowed with an idiosyncratic identity interact on a social network through strategic complements or substitutes. We classify the possible types of Nash equilibria under complete information, finding two thr…
Additional file 3 of What are the effects of even-aged and uneven-aged forest management on boreal forest biodiversity in Fennoscandia and European R…
2021
Additional file 3. Translations of the search string. Full search strings and simplified search strings for Google and Google Scholar in English, Swedish, Russian and Finnish.
Additional file 4 of Are small protected habitat patches within boreal production forests effective in conserving species richness, abundance and com…
2021
Additional file 4. Search strings. Full search strings in English and Russian, and simplified search strings for Google and Google Scholar in English, Russian, Swedish and Finnish.
Additional file 2 of Efficacy and acceptability of pharmacological and non-pharmacological interventions for non-specific chronic low back pain: a pr…
2020
Additional file 2. MEDLINE search string.
MOESM4 of What are the effects of even-aged and uneven-aged forest management on boreal forest biodiversity in Fennoscandia and European Russia? A sy…
2019
Additional file 4. The performance of the search string.
Upper bounds on multiparty communication complexity of shifts
1996
We consider some communication complexity problems which arise when proving lower bounds on the complexity of Boolean functions. In particular, we prove an \(O(\frac{n}{{2\sqrt {\log n} }}\log ^{1/4} n)\)upper bound on 3-party communication complexity of shifts, an O(n e ) upper bound on the multiparty communication complexity of shifts for a polylogarithmic number of parties. These bounds are all significant improvements over ones recently considered “unexpected” by Pudlak [5].
Some decisional problems on rational relations
1997
Abstract In this paper we prove that the problem of deciding whether a deterministic rational relation is star-free is recursively solvable, although the same problem for any rational relation is undecidable. We also prove that a rational relation is star-free if and only if it is aperiodic and deterministic.