Understanding Fashion Cycles as a Social Choice

We present a formal model for studying fashion trends, in terms of three parameters of fashionable items: (1) their innate utility; (2) individual boredom associated with repeated usage of an item; and (3) social influences associated with the preferences from other people. While there are several works that emphasize the effect of social influence in understanding fashion trends, in this paper we show how boredom plays a strong role in both individual and social choices. We show how boredom can be used to explain the cyclic choices in several scenarios such as an individual who has to pick a restaurant to visit every day, or a society that has to repeatedly `vote' on a single fashion style from a collection. We formally show that a society that votes for a single fashion style can be viewed as a single individual cycling through different choices. In our model, the utility of an item gets discounted by the amount of boredom that has accumulated over the past; this boredom increases with every use of the item and decays exponentially when not used. We address the problem of optimally choosing items for usage, so as to maximize over-all satisfaction, i.e., composite utility, over a period of time. First we show that the simple greedy heuristic of always choosing the item with the maximum current composite utility can be arbitrarily worse than the optimal. Second, we prove that even with just a single individual, determining the optimal strategy for choosing items is NP-hard. Third, we show that a simple modification to the greedy algorithm that simply doubles the boredom of each item is a provably close approximation to the optimal strategy. Finally, we present an experimental study over real-world data collected from query logs to compare our algorithms.


Similar Publications

In this paper, we consider a dense vehicular communication network where each vehicle broadcasts its safety information to its neighborhood in each transmission period. Such applications require low latency and high reliability, and thus, we exploit non-orthogonal multiple access to reduce the access latency and to improve the packet reception probability. In the proposed two-fold scheme, the BS performs semi-persistent scheduling and allocates time-frequency resources in a non-orthogonal manner while the vehicles autonomously perform distributed power control with iterative signaling control. Read More


Detecting defection and alarming partners about the possible danger could be essential to avoid being exploited. This act, however, may require a huge individual effort from those who take this job, hence such a strategy seems to be unfavorable. But structured populations can provide an opportunity where a largely unselfish excluder strategy can form an effective alliance with other cooperative strategies, hence they can sweep out defection. Read More


The problem of pricing the cloud has attracted much recent attention due to the widespread use of cloud computing and cloud services. From a theoretical perspective, several mechanisms that provide strong efficiency or fairness guarantees and desirable incentive properties have been designed. However, these mechanisms often rely on a rigid model, with several parameters needing to be precisely known in order for the guarantees to hold. Read More


In this work we derive a variant of the classic Glivenko-Cantelli Theorem, which asserts uniform convergence of the empirical Cumulative Distribution Function (CDF) to the CDF of the underlying distribution. Our variant allows for tighter convergence bounds for extreme values of the CDF. We apply our bound in the context of revenue learning, which is a well-studied problem in economics and algorithmic game theory. Read More


Smart cities must integrate a number of interdependent cyber-physical systems that operate in a coordinated manner to improve the well-being of the city's residents. A cyber-physical system (CPS) is a system of computational elements controlling physical entities. Large-scale CPSs are more vulnerable to attacks due to the cyber-physical interdependencies that can lead to cascading failures which can have a significant detrimental effect on a city. Read More


We consider the synthesis of distributed implementations for specifications in parameterized temporal logics such as PROMPT-LTL, which extends LTL by temporal operators equipped with parameters that bound their scope. For single process synthesis it is well-established that such parametric extensions do not increase worst-case complexities. For synchronous distributed systems we show that, despite being more powerful, the realizability problem for PROMPT-LTL is not harder than its LTL counterpart. Read More


There is no matching mechanism that satisfies integration monotonicity and stability. If we insist on integration monotonicity, not even Pareto optimality can be achieved: the only option is to remain segregated. A weaker monotonicity condition can be combined with Pareto optimality but not with path independence, which implies that the dynamics of social integration matter. Read More


Ranking alternatives is a natural way for humans to explain their preferences. It is being used in many settings, such as school choice (NY, Boston), course allocations, and the Israeli medical lottery. In some cases (such as the latter two), several "items" are given to each participant. Read More


This paper deals with two-sided matching with budget constraints where one side (firm or hospital) can make monetary transfers (offer wages) to the other (worker or doctor). In a standard model, while multiple doctors can be matched to a single hospital, a hospital has a {\em maximum quota}: the number of doctors assigned to a hospital cannot exceed a certain limit. In our model, a hospital instead has a {\em fixed budget}: the total amount of wages allocated by each hospital to doctors is constrained. Read More


We consider the problem of coordination via signaling in network congestion games to improve social welfare deteriorated by incomplete information about traffic flow. Traditional studies on signaling, which focus on exogenous factors of congestion and ignore congestion externalities, fail to discuss the oscillations of traffic flow. To address this gap, we formulate a problem of designing a coordination signal on endogenous information about traffic flow and introduce a it self-fulfilling characteristic of a signal that guarantees an outcome flow consistent with the signal itself without causing the unwanted oscillation. Read More