Social choice functions (SCFs) map the preferences of a group agents over some set alternatives to non-empty subset alternatives. The Gibbard-Satterthwaite theorem has shown that only extremely restrictive SCFs are strategyproof when there more than two For set-valued SCFs, or so-called social correspondences, situation is less clear. There miscellaneous -- mostly negative results using variety...

We propose a distributed spectrum access algorithm for cognitive radio relay networks with multiple primary users (PU) and multiple secondary users (SU). The key idea behind the proposed algorithm is that the PUs negotiate with the SUs on both the amount of monetary compensation, and the amount of time the SUs are either (i) allowed spectrum access, or (ii) cooperatively relaying the PU’s data,...

We study environments where a production process is jointly shared by a finite group of agents. The social decision involves the determination of input contribution and output distribution. We define a competitive solution when there is decreasing-returns-to-scale which leads to a Pareto optimal outcome. Since there is a finite number of agents, the competitive solution is prone to manipulation...

We propose a distributed spectrum access algorithm for cognitive radio relay networks with multiple primary users (PU) and multiple secondary users (SU). The key idea behind the proposed algorithm is that the PUs negotiate with the SUs on both the amount of monetary compensation, and the amount of time the SUs are either (i) allowed spectrum access, or (ii) cooperatively relaying the PU’s data,...

In this paper, we propose near admissible multiobjective search algorithms to approximate, with performance guarantee, the set of Pareto optimal solution paths in a state space graph. Approximation of Pareto optimality relies on the use of an epsilon-dominance relation between vectors, significantly narrowing the set of nondominated solutions. We establish correctness of the proposed algorithms...

This paper deals with multi-objective optimization in gait planning of a 7-dof biped robot ascending and descending some staircases. Both its power consumption as well as dynamic balance margin depends on a few common design parameters. The biped robot should have a maximum dynamic balance margin but at the expense of minimum power. Thus, a conflicting relationship exists between these two obje...

Shapley’s impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Although the result is no longer true for bargaining problems with more than two agents, none of the well known bargaining solutions are ordinal. Searching for meaningful ordinal solutions, especially for the bilateral bargaini...

Previous work has studied the classical joint economic lot size model as an adverse selection problem with asymmetric cost information. Solving this problem is challenging due to the presence of countervailing incentives and two-dimensional information asymmetry, under which the classical single-crossing condition does not need to hold. In the present work we advance the existing knowledge abou...

and Applied Analysis 3 min y f ( x, y ) s.t. g ( x, y ) ≥ 0, 2.1 where F x, y and f x, y are the upper level and the lower level objective functions, respectively. G x, y and g x, y denote the upper level and the lower level constraints, respectively. Let S { x, y | G x, y ≥ 0, g x, y ≥ 0}, X {x | ∃y, G x, y ≥ 0, g x, y ≥ 0}, S x {y | g x, y ≥ 0}, and for the fixed x ∈ X, let S X denote the wea...

This paper presents a method to predict the relative objective weighting scheme necessary to cause arbitrary members of a Pareto solution set to become optimal. First, a polynomial description of the Pareto set is constructed utilizing simulation and high performance computing. Then, using geometric relationships between the member of the Pareto set in question, the location of the utopia point...