Incorporating fairness criteria in optimization problems comes at a certain cost, which is measured by the so-called price of fairness. Here we consider the allocation of indivisible goods. For envy-freeness as fairness criterion it is known from literature that the price of fairness can increase linearly in terms of the number of agents. For the constructive lower bound a quadratic number of i...

Various fairness objectives are studied in relation to Pareto optimal sets and Nash equilibria. We examine the already discussed general parameterized fairness objective that covers a variety of fairness criteria and the newly introduced Nash-proportionate-fairness objective. We study them mainly numerically on a simple static load balancing model with two identical servers (computers) each of ...

Abstract Automated data-driven decision systems are ubiquitous across a wide variety of online services, from online social networking and ecommerce to e-government. These systems rely on complex learning methods and vast amounts of data to optimize the service functionality, satisfaction of the end user and profitability. However, there is a growing concern that these automated decisions can l...

We compare the performance of three usual allocations, namely max-min fairness, proportional fairness and balanced fairness, in a communication network whose resources are shared by a random number of data flows. The model consists of a network of processorsharing queues. The vector of service rates, which is constrained by some compact, convex capacity set representing the network resources, i...

Replicated multicast service deals with the well-known problem of heterogeneity by dividing receivers into multiple multicast groups. Most of current work focuses on optimizing the social welfare represented as a sum of some performance measures of receivers. In this paper we define a new concept called intra-session fairness and present an optimal solution to achieve fairness among receivers i...

The market economy deals with many interacting agents such as buyers and sellers who are autonomous intelligent agents pursuing their own interests. One such multi-agent system (MAS) that plays an important role in auctions is the combinatorial auctioning system (CAS). We use this framework to define our concept of fairness in terms of what we call as “basic fairness” and “extended fairness.” T...

Certain social preference models have been proposed to explain fairness behavior in experimental games. Existing bodies of research on evolutionary games, however, explain the evolution of fairness merely through the self-interest agents. This paper attempts to analyze the ultimatum game's evolution on complex networks when a number of agents display social preference. Agents' social preference...

In networking, it is often required to quantify by how much one protocol is fairer than another and how certain parameter setting and/or protocol enhancements improve fairness. This paper provides a framework to evaluate the fairness of various protocols in a general telecommunications network. Within this framework, there are two key components: (1) a benchmark and (2) a single dimension metri...

Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of certain kinds of denial-of-service attacks, and serve as a critical component of a quality-of-service strategy to achieve certain guaranteed services such as delay bounds and minimum bandwidths. Several research efforts h...

Cooperative (co-op) advertising has been widely used in practice and employed as a strategy to improve the performance of a distribution channel. It is known from the existing models that co-op advertising could not achieve the channel coordination (i.e., maximize the total channel profit). In this paper, we consider a distribution channel consisting of a single manufacturer and a single retail...