منابع مشابه
RUHR ECONOMIC PAPERS Generating Random Optimising Choices
This paper provides an effi cient way to generate a set of random choices on a set of budgets which satisfy the Generalised Axiom of Revealed Preferences (GARP), that is, they are consistent with utility maximisation. The choices are drawn from an approximate uniform distribution on the admissible region on each budget which ensures consistency with GARP, based on a Markovian Monte Carlo algori...
متن کاملIntentionally Generating Choices in Interactive Narratives
Interactive stories face a famous “authorial bottleneck.” Two existing approaches to this problem are story management systems, such as drama managers, and interactive narrative generators. Existing work leverages well-understood qualities of linear narrative such as suspense to generate content, but interactivity brings new capacities, like the ability to make a player experience regret. These...
متن کاملGenerating random braids
We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated braids. As a byproduct, we describe a finite state automaton accepting the language of lexicographically minimal representatives of positive braids that has the mi...
متن کاملGenerating Random Orthogonal Polygons
We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a technique we developed to obtain polygons with an increasing number of vertices starting from a unit square. The other follows a constraint programming approach and gives great control on the generated polygons. In particular, it...
متن کاملGenerating Random Spanning Trees
This paper describes a probabilistic algorithm that, given a connected, undirected graph G with n vertices, produces a spanning tree of G chosen uniformly at random among the spanning trees of G. The expected running time is O(n logn) per generated tree for almost all graphs, and O(n3) for the worst graphs. Previously known deterministic algorithms and much more complicated and require O(n3) ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2012
ISSN: 1556-5068
DOI: 10.2139/ssrn.2122540