Quantity discount is a frequently adopted scheme that has not been explicitly investigated in logistics service procurement auctions. This paper focuses on revised winner determination problem under quantity discounts and demand uncertainty for fourth-party (4PL) provider combinatorial reverse auction. To characterize our research problem, two-stage stochastic nonlinear programming model constr...

We consider election scenarios with incomplete information, a situation that arises often in practice. There are several models of incomplete information and accordingly, different notions of outcomes of such elections. In one well-studied model of incompleteness, the votes are given by partial orders over the candidates. In this context we can frame the problem of finding a possible winner, wh...

The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact definition, is method ranked pairs. original version method, due to Tideman, yields a social preference function that irresolute and neutral. variant introduced subsequently uses an exogenously given tie-breaking rule ...

female- headed house holds as one of social harmful groups in front of various problems in life among exist conflict at family. the work roles cause doual roles which are important problem for wemen. in this research, effort to use from grounded theory method and done deep interview to 25 person from female- headed house holds refer to main problem of this women. results data analysis and parad...

We study the complexity of (approximate) winner determination underMonroe’s and ChamberlinCourant’s multiwinner voting rules, where we focus on the total (dis)satisfaction of the voters (the utilitarian case) or the (dis)satisfaction of the worstoff voter (the egalitarian case). We show good approximation algorithms for the satisfaction-based utilitarian cases, and inapproximability results for...

In this paper, we study the problem of deciding the winner of reachability switching games. These games provide deterministic analogues of Markovian systems. We study zero-, one-, and two-player variants of these games. We show that the zero-player case is NL-hard, the one-player case is NP-complete, and that the two-player case is PSPACE-hard and in EXPTIME. In the oneand two-player cases, the...

A combinatorial auction is one in which preferences are expressed for combinations or bundles of items, rather than just for individual items. The importance of combinatorial auctions has grown tremendously in the past 15 years, which have seen an explosion in the use of auction mechanisms in both government allocation problems and businessto-business commerce. Chapter 2 of the dissertation out...

Given a tournament T, a Banks winner of T is the top vertex of any maximal (with respect to inclusion) transitive subtournament of T. In this technical note, we show that the problem of deciding whether some fixed vertex v is a Banks winner for T is NP-complete.