نتایج جستجو برای: lexicographic

تعداد نتایج: 2659  

2015
Doug J. Chung Lingling Zhang

We examine the effects of various political campaign activities on voter preferences in the domain of US Presidential elections. We construct a comprehensive data set that covers the three most recent elections, with detailed records of voter preferences at the state-week level over an election period. We include various types of the most frequently utilized marketing instruments: two forms of ...

2007
Barry O'Sullivan Alexandre Papadopoulos Boi Faltings Pearl Pu

In many interactive decision making scenarios there is often no solution that satisfies all of the user’s preferences. The decision process can be helped by providing explanations. Relaxations show sets of consistent preferences and, thus, indicate which preferences can be enforced, while exclusion sets show which preferences can be relaxed to obtain a solution. We propose a new approach to exp...

Journal: :Math. Program. 2005
Yurii Nesterov

We present a survey on the results related to the theory of lexicographic differentiation. This theory ensures an efficient computation of generalized (lexicographic) derivative of a nonsmooth function belonging to a special class of lexicographically smooth functions. This class is a linear space which contains all differentiable functions, all convex functions, and which is closed with respec...

Journal: :Computational Linguistics 2014
Richard Sproat Mahsa Yarmohammadi Izhak Shafran Brian Roark

This paper explores lexicographic semirings and their application to problems in speech and language processing. Specifically, we present two instantiations of binary lexicographic semirings, one involving a pair of tropical weights, and the other a tropical weight paired with a novel string semiring we term the categorial semiring. The first of these is used to yield an exact encoding of backo...

Journal: :Comput. J. 1987
M. C. Er

This paper presents three simple and efficient algorithms for generating, ranking and unranking t-ary trees in a lexicographic order. The simplest idea of encoding a t-ary tree with n nodes as a bit-string of length t*n is exploited to its full advantages. It is proved that the lexicographic order in the set of t-ary trees with n nodes is preserved in the set of bit-strings of length t*n, using...

2010
Vijay Krishna John Morgan

We study a model in which voters choose between two candidates on the basis of both ideology and competence. While the ideology of the candidates is commonly known, voters are imperfectly informed about competence. Voter preferences, however, are such that it is a dominant strategy to vote according to ideology alone. When voting is compulsory, the candidate of the majority ideology prevails an...

Journal: :J. Economic Theory 2013
Jayant V. Ganguli Aviad Heifetz

We prove that a universal preference type space exists under much more general conditions than those postulated by Epstein and Wang (1996). To wit, it is enough that preferences can be encoded by a countable collection of continuous functionals, while the preferences themselves need not necessarily be continuous or regular, like, e.g., in the case of lexicographic preferences. The proof relies ...

2010
Vladimir A. Emelichev Evgeny E. Gurevsky Kirill G. Kuzmin

A lexicographic integer optimization problem with criteria represented by absolute values of linear functions is considered. Five types of stability for the set of lexicographic optima under small changes of the parameters of the vector criterion are investigated.

2015
Fabio Gagliardi Cozman

Sets of lexicographic probabilities and sets of desirable gambles share several features, despite their apparent differences. In this paper we examine properties of marginalization, conditioning and independence for sets of lexicographic probabilities and sets of desirable gambles.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید