abstract there are varieties of researches for appraisal of results obtained by countries in olympics, using data envelopment analysis method. this research is aimed to make such appraisal for iranians’ results in olympics games using the dea method. before taking any measures, main issues of dea methods for appraisal of olympics games in the previous research were discussed, afterward optimiza...

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 2 July 2018Accepted: 04 January 2021Published online: 15 April 2021Keywordsoptimal stopping, nonzero-sum optimal stopping games, Nash equilibrium, Brownian motion, generalized equilibrium problemsAMS Subject Headings60G40, 91A05, 91A15, 91A06, 91B52Publication DataISSN (p...

We consider capacity management games between airlines who transport passengers over a joint airline network. Passengers are likely to purchase alternative tickets of the same class from competing airlines if they do not get tickets from their preferred airlines. We propose a Nash and a generalized Nash game model for such a capacity competition problem over a network. These two models are base...

We construct a statistical ensemble of games, where in each independent subensemble we have two players playing the same game. We derive the mean payoffs per move of the representative players of the game, and we evaluate all the deterministic policies with finite memory. In particular, we show that if one of the players has a generalized tit-for-tat policy, the mean payoff per move of both pla...

Determining the complexity of perfect information trick-taking card games is a long standing open problem. This question is worth addressing not only because of the popularity of these games among human players, e.g., DOUBLE DUMMY BRIDGE, but also because of its practical importance as a building block in state-of-the-art playing engines for CONTRACT BRIDGE, SKAT, HEARTS, and SPADES. We define ...

where capG(S, S̄) is the total weight of the edges crossing from S to S̄ = V − S. We show that the minimum generalized eigenvalue λ(LG, LH) of the pair of Laplacians LG and LH satisfies λ(LG, LH) ≥ φ(G,H)φ(G)/8, where φ(G) is the usual conductance of G. A generalized cut that meets this bound can be obtained from the generalized eigenvector corresponding to λ(LG, LH). The inequality complements a...