公共设施分布公平性问题初探

不管规划范围内居民的社会经济状况、意愿、人口分布是否相同,都应该得到公共设施服务。公共设施由于其自身的独特性质、普遍的“市场失灵”、政府行政的干预和社会群体的分层等原因,存在配置的公平性问题。从公共设施配置中的投资建设方面来说,需重视对市场运作的积极引导、改善政府介入的方式,促进公众参与机制的形成。     

When and how authoritarian leadership and leader renqing orientation influence tacit knowledge sharing intentions

In this study of tacit knowledge-sharing intentions in China, we examine the roles of authoritarian leadership and fairness with respect to the way managers make decisions and treat their subordinates. In particular, we examine the role of leader renqing orientation, i.e., the way leaders distribute favors and emotional concern to their subordinates, as a moderating factor. We draw on the research literature in the domains of knowledge management and cross-cultural Psychology to identify constructs that we then test with a survey of 309 Chinese employees. Our findings are counter-intuitive and are discussed in detail before we conclude with implications for research and practice.     

＂哲匠＂与＂塞米丝＂的结合——浅谈城市规划职业制度困境以及对律师制度借鉴的可能性

城市规划学科职业实践中的困境越来越受到社会的关注,而社会对其的看法也莫衷一是。而这个困境需要在什么方面寻求突破？本文立足于城市规划职业实践的困境以及职业制度的不足：工作内容缺失、权威性缺失、公平性、正义职责履行不足以及公众参与落实难,对比分析了城市规划职业制度与律师职业制度以及国外相关探索,建议规划职业制度的完善可以借...     

Solving House Allocation Problems with Risk-Averse Agents

This paper solves the fair and optimal house allocation problem (Sun and Yang, Econ Lett 81:73–79, 2003) when the agents preferences are represented by nonlinear utility functions using techniques for global mixed integer nonlinear optimization. A small simulation study indicates that if quasi-linear specifications are adopted as approximations to nonlinear utility functions and if the fair and optimal allocation is identified based on this approximation, then the prices are typically higher on average and the resulting allocation is typically non-fair.     

Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency

We study online adaptive scheduling for multiple sets of parallel jobs, where each set may contain one or more jobs with time-varying parallelism. This two-level scheduling scenario arises naturally when multiple parallel applications are submitted by different users or user groups in large parallel systems, where both user-level fairness and system-wide efficiency are of important concerns. To achieve fairness, we use the well-known equi-partitioning algorithm to distribute the available processors among the active job sets at any time. For efficiency, we apply a feedback-driven adaptive scheduler that periodically adjusts the processor allocations within each set by consciously exploiting the jobs’ execution history. We show that our algorithm achieves asymptotically competitive performance with respect to the set response time, which incorporates two widely used performance metrics, namely, total response time and makespan, as special cases. Both theoretical analysis and simulation results demonstrate that our algorithm improves upon an existing scheduler that provides only fairness but lacks efficiency. Furthermore, we provide a generalized framework for analyzing a family of scheduling algorithms based on feedback-driven policies with provable efficiency. Finally, we consider an extended multi-level hierarchical scheduling model and present a fair and efficient solution that effectively reduces the problem to the two-level model.     

云计算中一种多DAG工作流可抢占式调度策略

为解决多用户工作流调度过程中的公平性问题,提高资源利用率,满足不同用户DAG工作流的不同QoS需求,提出了抢占式多DAG工作流动态调度模型。该算法将DAG工作流按照QoS需求进行优先级划分,采用高优先级作业优先占有资源的原则调度作业。相同优先级DAG工作流的任务依据带有启发性信息的slowdown进行资源抢占,进一步提高了作业调度的公平性;对于不同优先级的作业调度,提出了基于阈值的回填算法,该算法在保证作业调度公平的同时提高了资源利用率。     

基于博弈论的百万富翁协议

在经典的百万富翁协议中,一方在得到最后的财富比较结果后,没有动机将结果告诉另一方,或者告诉另一方一个错误的结果。结合博弈论和密码算法,提出一种百万富翁协议。在此协议中,参与者背离协议的收益小于遵守协议的收益,遵守协议是参与者的最优策略,任何百万富翁的欺骗行为都能被鉴别和发现,因此理性的参与者有动机发送正确的数据。最后每个参与者都能公平地得到最后的财富比较结果。     

Event fairness and non-interleaving concurrency

Event fairness suitable for non-interleaving concurrency is proposed. Fairness is viewed with respect to concurrency, rather than non-determinism, in the sense that no concurrent component of the system should be delayed indefinitely. Shields' asynchronous transition systems and Mazurkiewicz's traces have been used; the model gives rise to a partial order. A class of generalised notions of (weak, strong and unconditional) event fairness relative to progress requirements is derived. The weakest fairness notion in this class is shown to coincide with maximality with respect to the partial order over traces.