oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
The Complexity of MaxMin Length Triangulation  [PDF]
Sándor P. Fekete
Computer Science , 2012,
Abstract: In 1991, Edelsbrunner and Tan gave an O(n^2) algorithm for finding the MinMax Length triangulation of a set of points in the plane. In this paper we resolve one of the open problems stated in that paper, by showing that finding a MaxMin Length triangulation is an NP-complete problem. The proof implies that (unless P=NP), there is no polynomial-time approximation algorithm that can approximate the problem within any polynomial factor.
Finding maxmin allocations in cooperative and competitive fair division  [PDF]
Marco Dall'Aglio,Camilla Di Luca
Mathematics , 2011,
Abstract: We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.
Exam fairness  [PDF]
Mathieu Bouville
Physics , 2008,
Abstract: It is widely agreed that exams must be fair; yet what this exactly means is not made clear. One may mean fairness of treatment, but this merely propagates the fairness or unfairness of pre-existing rules. Fairness of opportunity on the other hand necessarily leads to identical grades for everyone, which clearly makes it inapplicable. Neither view is helpful to make decisions on competing claims: fairness of treatment ignores the problem and fairness of opportunity holds all claims to be equally valid. To escape this deadlock one needs an external criterion to replace fairness viewed as student-student comparison. Keywords: assessment; bias; engineering education; examinations; grading; justice; tests
Checking Properties within Fairness and Behavior Abstractions  [PDF]
Ulrich Ultes-Nitsche,Pierre Wolper
Computer Science , 2001,
Abstract: This paper is motivated by the fact that verifying liveness properties under a fairness condition is often problematic, especially when abstraction is used. It shows that using a more abstract notion than truth under fairness, specifically the concept of a property being satisfied within fairness can lead to interesting possibilities. Technically, it is first established that deciding satisfaction within fairness is a PSPACE-complete problem and it is shown that properties satisfied within fairness can always be satisfied by some fair implementation. Thereafter, the interaction between behavior abstraction and satisfaction within fairness is studied and it is proved that satisfaction of properties within fairness can be verified on behavior abstractions, if the abstraction homomorphism is weakly continuation-closed.
THE CONDITIONS FOR OPTIMALITY OF A CLASS OF THE GENERALIZED MAXMIN PROBLEMS R~n
R~n 空间一类广义 MAXMIN 问题的最优性条件

FU YI-HUI,LI MI-AN,
傅诒辉

系统科学与数学 , 1990,
Abstract: In this paper,a class of generalized maxmin probltms in R~n is considered and,accordingly,necessary and sufficient conditions for optimality of the problem are presented.A relation bet-ween the optimum of the generalized maxmin problem and the weak efficient solution (weakPareto optimum) of the multiobjective program is also discussed.
Explicit fairness in testing semantics  [PDF]
D. Cacciagrano,F. Corradini,C. Palamidessi
Computer Science , 2009, DOI: 10.2168/LMCS-5(2:15)2009
Abstract: In this paper we investigate fair computations in the pi-calculus. Following Costa and Stirling's approach for CCS-like languages, we consider a method to label process actions in order to filter out unfair computations. We contrast the existing fair-testing notion with those that naturally arise by imposing weak and strong fairness. This comparison provides insight about the expressiveness of the various `fair' testing semantics and about their discriminating power.
Fairness in society  [PDF]
Ophir Flomenbom
Computer Science , 2011,
Abstract: Models that explain the economical and political realities of nowadays societies should help all the world's citizens. Yet, the last four years showed that the current models are missing. Here we develop a dynamical society-deciders model showing that the long lasting economical stress can be solved when increasing fairness in nations. fairness is computed for each nation using indicators from economy and politics. Rather than austerity versus spending, the dynamical model suggests that solving crises in western societies is possible with regulations that reduce the stability of the deciders, while shifting wealth in the direction of the people. This shall increase the dynamics among socio-economic classes, further increasing fairness.
Truthfulness, Proportional Fairness, and Efficiency  [PDF]
Richard Cole,Vasilis Gkatzelis,Gagan Goel
Computer Science , 2012,
Abstract: How does one allocate a collection of resources to a set of strategic agents in a fair and efficient manner without using money? For in many scenarios it is not feasible to use money to compensate agents for otherwise unsatisfactory outcomes. This paper studies this question, looking at both fairness and efficiency measures. We employ the proportionally fair solution, which is a well-known fairness concept for money-free settings. But although finding a proportionally fair solution is computationally tractable, it cannot be implemented in a truthful fashion. Consequently, we seek approximate solutions. We give several truthful mechanisms which achieve proportional fairness in an approximate sense. We use a strong notion of approximation, requiring the mechanism to give each agent a good approximation of its proportionally fair utility. In particular, one of our mechanisms provides a better and better approximation factor as the minimum demand for every good increases. A motivating example is provided by the massive privatization auction in the Czech republic in the early 90s. With regard to efficiency, prior work has shown a lower bound of 0.5 on the approximation factor of any swap-dictatorial mechanism approximating a social welfare measure even for the two agents and multiple goods case. We surpass this lower bound by designing a non-swap-dictatorial mechanism for this case. Interestingly, the new mechanism builds on the notion of proportional fairness.
Cultural Politics and Education in Ethiopia: A Search for a Viable Indigenous Legend  [cached]
Mohammed Girma
Journal of Politics and Law , 2012, DOI: 10.5539/jpl.v5n1p117
Abstract: The history of modern education in Ethiopian is short. What is not so short, however, is the history of traditional education, temehert. It goes back as far as the introduction of Christianity to Ethiopia – fourth century EC. Since its inception, education had a close, if ambivalent, relationship with different ideological tenets, and each tenet trying to formulate its educational philosophy around its own unique narrative. While some narratives arose from indigenous legend, others are imported (and domesticated in some cases) from abroad. In this essay, I do not intend to discuss educational policies per se. I, however, intend to show how a deliberate, or unwitting, de-link with indigenous legend would affect the trajectory, and also the success, in educational system in Ethiopia. After a brief paradigmatic characterization of two ideologies and their underlying narratives, I will critically unravel the ethno-federalism educational philosophy of Ethiopian People’s Revolutionary Democratic Front (EPRDF) and its undergirding ethnic legends. I focus on ethno-federalist system because it is an incumbent philosophy. After discussing a nascent remedy proposed by MaimireMennasemay, vis,.the notion of tezeta, I intend to argue for the primacy of the notion of qal-kidan as a better alternative. I will base my argument on the cultural prevalence, but also conceptual credibility.
Fairness in Combinatorial Auctioning Systems  [PDF]
Megha Saini,Shrisha Rao
Computer Science , 2008,
Abstract: One of the Multi-Agent Systems that is widely used by various government agencies, buyers and sellers in a market economy, in such a manner so as to attain optimized resource allocation, is the Combinatorial Auctioning System (CAS). We study another important aspect of resource allocations in CAS, namely fairness. We present two important notions of fairness in CAS, extended fairness and basic fairness. We give an algorithm that works by incorporating a metric to ensure fairness in a CAS that uses the Vickrey-Clark-Groves (VCG) mechanism, and uses an algorithm of Sandholm to achieve optimality. Mathematical formulations are given to represent measures of extended fairness and basic fairness.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.