Filters








167,779 Hits in 7.4 sec

One line and n points

Bernd Gärtner, Falk Tschirschnitz, Emo Welzl, József Solymosi, Pavel Valtr
2003 Random structures & algorithms (Print)  
We analyze a randomized pivoting process involving one line and n points in the plane.  ...  The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes with n facets in dimension n Ϫ 2. We obtain a tight O(log 2 n) bound for the expected number of pivot steps.  ...  We will now show that RANDOM-EDGE on ᏼ is equivalent to the process given in Fig. 14 on some configuration of n points and one line in dimension n Ϫ d.  ... 
doi:10.1002/rsa.10099 fatcat:dotejrveuvbo7p44cbaoogzupi

Analysis of the expected density of internal equilibria in random evolutionary multi-player multi-strategy games [article]

Manh Hong Duong, The Anh Han
2016 arXiv   pre-print
As consequences of our analysis, some qualitative and quantitative results on the distribution of zeros of a random Bernstein polynomial are also obtained.  ...  In this paper, we study the distribution and behaviour of internal equilibria in a d-player n-strategy random evolutionary game where the game payoff matrix is generated from normal distributions.  ...  Acknowledgements We would like to thank the anonymous referee for his/her useful suggestions that helped us to improve the presentation of the manuscript.  ... 
arXiv:1505.04676v3 fatcat:ount4dvcgrd2vk2rxqoxw7nr4e

Analysis of a Poisson-picking symmetric winners-take-all game with randomized payoffs [article]

Abel Molina
2019 arXiv   pre-print
We obtain analytic characterizations of the symmetric equilibria in the case of only 2 agents and in the case where there are only two possible top-scorers.  ...  At the same time, when the payoff of a process depends on a parameter choice that is symmetric with respect to agents, all agents have the incentive to choose the values of the parameter that lead to higher  ...  Given integers n ≥ 2, m ≥ 2, and a random variable X taking values in the set of ordered partitions of {1, . . . , m}, the winners-take-all pool W with parameters (n, m, X) is the following game: 1.  ... 
arXiv:1906.03618v1 fatcat:jvvrgm76gbffpfgxyuiwtvoms4

Generating functional analysis of the dynamics of the batch minority game with random external information

J. A. F. Heimel, A. C. C. Coolen
2001 Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics  
We study the dynamics of the batch minority game, with random external information, using generating functional techniques a la De Dominicis.  ...  In the limit N→∞ we calculate the location α_c of the phase transition (signaling the onset of anomalous response), and solve the statics for α>α_c exactly.  ...  From the starting point A(l)ϭN Ϫ1/2 ͚ i ͓ i (l) ϩs i (l) i (l) ͔ and on the time scales of the process ͑2͒, one easily derives ͗A͘ϭ 1 ␣NͱN ͚ i s i ͚ i ϩO ͩ 1 ͱN ͪ , ͑3͒ ͗A 2 ͘ϭ 1 2 ϩ 1 ␣N ͚ͫ i h i s i  ... 
doi:10.1103/physreve.63.056121 pmid:11414975 fatcat:2x2l6fzerfhprpcxnld3naft64

STOCHASTIC GAMES OF CONTROL AND STOPPING FOR A LINEAR DIFFUSION

IOANNIS KARATZAS, WILLIAM SUDDERTH
2006 Random Walk, Sequential Analysis and Related Topics  
Under mild technical assumptions we show that the first game has a value, and find a saddle point of optimal strategies for the players.  ...  This game terminates at the minimum τ ∧ ρ of the stopping rules τ and ρ , and players A , B want to maximize the expectations of u(X τ ∧ρ ) and v(X τ ∧ρ ) , respectively.  ...  Thus, the nonnegativity of D − U (·) and of the term in brackets on the second line of (2.6) guarantee that U (H ·∧τ * ) is a bounded local submartingale, hence a (bounded, and genuine) submartingale.  ... 
doi:10.1142/9789812772558_0007 fatcat:n3bxzwgkyzgdhfpv7qytch3twy

Stochastic Game Analysis of Cooperation and Selfishness in a Random Access Mechanism

Ahmed Boujnoui, Abdellah Zaaloul, Luis Orozco-Barbosa, Abdelkrim Haqiq
2022 Mathematics  
This paper introduces a general stochastic game analysis of a network scenario consisting of a mix of cooperative and non-cooperative players (i.e., users) under incomplete game information.  ...  their own benefits irrespective of the impact of this behavior on others and on the entire network system.  ...  Therefore, the game from the point of view of the set S N is a non-cooperative game of M + N users.  ... 
doi:10.3390/math10050694 fatcat:pmvtsmadzfdm7a43zsflrh2hua

Using random forests to estimate win probability before each play of an NFL game

Dennis Lock, Dan Nettleton
2014 Journal of Quantitative Analysis in Sports (JQAS)  
and current score) as well as the relative quality of the two teams as quantified by the Las Vegas point spread.  ...  We use a random forest method to combine pre-play variables to estimate Win Probability (WP) before any play of an NFL game.  ...  ( ) , k i k k i N y y where N 1 is the set of training observations with x ≤ c, N 2 is the set of training observations with x > c, and k y is the response mean for training observations in N k (k =  ... 
doi:10.1515/jqas-2013-0100 fatcat:y2asceioafgujgqichs6lmlkpq

Analysis of the expected density of internal equilibria in random evolutionary multi-player multi-strategy games

Manh Hong Duong, The Anh Han
2016 Journal of Mathematical Biology  
As consequences of our analysis, some qualitative and quantitative results on the distribution of zeros of a random Bernstein polynomial are also obtained.  ...  The main contributions of the paper are some qualitative and quantitative results on the expected density, f n,d , and the expected number, E(n, d), of (stable) internal equilibria.  ...  Acknowledgements We would like to thank the anonymous referee for his/her useful suggestions that help us to improve the presentation of the manuscript.  ... 
doi:10.1007/s00285-016-1010-8 pmid:27107868 fatcat:4afjgjuuxjfzdpvuu72dgkgsyy

Quantitative analysis of randomness exhibited by river channels using chaos game technique: Mississippi, Amazon, Sava and Danube case studies

G. Žibret, T. Verbovšek
2009 Nonlinear Processes in Geophysics  
The quantitative data about the scale of the random behaviour of the river channel pathway was evaluated by determination of the completeness of the triangle, generated on the basis of sequences representing  ...  the river channel, and measured by its fractal dimension.  ...  Mata-Toledo and Thilo Gross for useful comments which improved the quality of the paper, especially for the tips on computer generated rivers. Edited by: U. Feudel Reviewed by: T. Gross and R.  ... 
doi:10.5194/npg-16-419-2009 fatcat:kptpuwtx3jdrzlqkdb5ek6ycjm

Do brief motivational interventions reduce drinking game frequency in mandated students? An analysis of data from two randomized controlled trials

Anne C. Fernandez, Ali M. Yurasek, Jennifer E. Merrill, Mary Beth Miller, Byron L. Zamboanga, Kate B. Carey, Brian Borsari
2017 Psychology of Addictive Behaviors  
College students frequently engage in drinking games (DGs) and experience a variety of consequences as a result.  ...  Mandated college students (Trial 1, N ϭ 198, 46% female; Trial 2, N ϭ 412; 32% female) were randomized to BMI or comparison control conditions.  ...  analysis of three randomized controlled trials (Henson, Pearson, & Carey, 2015) .  ... 
doi:10.1037/adb0000239 pmid:27936818 pmcid:PMC5293610 fatcat:rx34htbgfbd7zglobncodz5adu

A point-based POMDP algorithm for robot planning

M.T.J. Spaan, N. Spaan
2004 IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004  
Our algorithm belongs to the family of point-based value iteration solution techniques for POMDPs, in which planning is performed only on a sampled set of reachable belief points.  ...  We describe a simple, randomized procedure that performs value update steps that strictly improve the value of all belief points in each step.  ...  Acknowledgments This research is supported by PROGRESS, the embedded systems research program of the Dutch organization for Scientific Research NWO, the Dutch Ministry of Economic Affairs and the Technology  ... 
doi:10.1109/robot.2004.1307420 dblp:conf/icra/SpaanV04 fatcat:uij2r6sj3rawxg6jeyhbig53na

Divisible On-Line/Off-Line Signatures [chapter]

Chong-zhi Gao, Baodian Wei, Dongqing Xie, Chunming Tang
2009 Lecture Notes in Computer Science  
This paper discusses this exposure problem and introduces a new notion: divisible on-line/off-line signatures, in which exposure of off-line signature tokens in off-line phase is allowed.  ...  Furthermore, we show an important application of divisible on-line/off-line signatures in the area of on-line/off-line threshold signatures.  ...  Acknowledgement We thank the anonymous reviewers of the conference CT-RSA 2009 for their valuable comments and suggestions.  ... 
doi:10.1007/978-3-642-00862-7_10 fatcat:777ed5k5tng43e6rd5hg4nw7ju

R–LINE: A Better Randomized 2-Server Algorithm on the Line [chapter]

Lucas Bang, Wolfgang Bein, Lawrence L. Larmore
2013 Lecture Notes in Computer Science  
A randomized on-line algorithm is given for the 2-server problem on the line, with competitiveness less than 1.901 against the oblivious adversary.  ...  This improves the previously best known competitiveness of 155 78 ≈ 1.987 for the problem. The algorithm uses a new approach and defines a potential in terms of isolation indices from T-theory.  ...  Acknowledgement Part of the work of author Wolfgang Bein was supported by National Science Foundation grant IIA 1427584.  ... 
doi:10.1007/978-3-642-38016-7_11 fatcat:mllli7t52fdrrnjwk3xfxady4i

R–LINE: A better randomized 2-server algorithm on the line

Lucas Bang, Wolfgang Bein, Lawrence L. Larmore
2015 Theoretical Computer Science  
A randomized on-line algorithm is given for the 2-server problem on the line, with competitiveness less than 1.901 against the oblivious adversary.  ...  This improves the previously best known competitiveness of 155 78 ≈ 1.987 for the problem. The algorithm uses a new approach and defines a potential in terms of isolation indices from T-theory.  ...  Acknowledgement Part of the work of author Wolfgang Bein was supported by National Science Foundation grant IIA 1427584.  ... 
doi:10.1016/j.tcs.2015.08.043 fatcat:uyn2nh2id5cevdin5sqlugrpou

On-Line Difference Maximization

Ming-Yang Kao, Stephen R. Tate
1999 SIAM Journal on Discrete Mathematics  
An analysis shows that the optimal expected off-line gain is n 2 /6 + Θ(1), so the performance of our on-line algorithm is within a factor of 3/4 of the best off-line strategy.  ...  In this paper we examine problems motivated by on-line financial problems and stochastic games.  ...  On-line analysis. In our on-line algorithm for multiple pair selection, there are two possible states: free and holding.  ... 
doi:10.1137/s0895480196307445 fatcat:psqil3kpczhd3bhrztpp3rhypy
« Previous Showing results 1 — 15 out of 167,779 results