Software for cut-generating functions in the Gomory--Johnson model and beyond

We present software for investigations with cut generating functions in the Gomory-Johnson model and extensions, implemented in the computer algebra system SageMath.Comment: 8 pages, 3 figures; to appear in Proc. International Congress on Mathematical Software 201

Market games and clubs

The equivalence of markets and games concerns the relationship between two sorts of structures that appear fundamentally different -- markets and games. Shapley and Shubik (1969) demonstrates that: (1) games derived from markets with concave utility functions generate totally balanced games where the players in the game are the participants in the economy and (2) every totally balanced game generates a market with concave utility functions. A particular form of such a market is one where the commodities are the participants themselves, a labor market for example. But markets are very special structures, more so when it is required that utility functions be concave. Participants may also get utility from belonging to groups, such as marriages, or clubs, or productive coalitions. It may be that participants in an economy even derive utility (or disutility) from engaging in processes that lead to the eventual exchange of commodities. The question is when are such economic structures equivalent to markets with concave utility functions. This paper summarizes research showing that a broad class of large economies generate balanced market games. The economies include, for example, economies with clubs where individuals may have memberships in multiple clubs, with indivisibile commodities, with nonconvexities and with non-monotonicities. The main assumption are: (1) that an option open to any group of players is to break into smaller groups and realize the sum of the worths of these groups, that is, essential superadditivity is satisfied and :(2) relatively small groups of participants can realize almost all gains to coalition formation. The equivalence of games with many players and markets with many participants indicates that relationships obtained for markets with concave utility functions and many participants will also hold for diverse social and economic situations with many players. These relationships include: (a) equivalence of the core and the set of competitive outcomes; (b) the Shapley value is contained in the core or approximate cores; (c) the equal treatment property holds -- that is, both market equilibrium and the core treat similar players similarly. These results can be applied to diverse economic models to obtain the equivalence of cooperative outcomes and competitive, price taking outcomes in economies with many participants and indicate that such results hold in yet more generality.Markets; games; market games; clubs; core; market-game equivalence; Shapley value; price taking equilibrium; small group effectiveness; inessentiality of large groups; per capita boundedness; competitive equilibrium; games with side payments; balanced games; totally balanced games; local public goods, core convergence; equal treatment property; equal treatment core; approximate core; strong epsilon core; weak epsilon core; cooperative game; asymptotic negligibility

Algorithms for Graph-Constrained Coalition Formation in the Real World

Coalition formation typically involves the coming together of multiple, heterogeneous, agents to achieve both their individual and collective goals. In this paper, we focus on a special case of coalition formation known as Graph-Constrained Coalition Formation (GCCF) whereby a network connecting the agents constrains the formation of coalitions. We focus on this type of problem given that in many real-world applications, agents may be connected by a communication network or only trust certain peers in their social network. We propose a novel representation of this problem based on the concept of edge contraction, which allows us to model the search space induced by the GCCF problem as a rooted tree. Then, we propose an anytime solution algorithm (CFSS), which is particularly efficient when applied to a general class of characteristic functions called $m+a$ functions. Moreover, we show how CFSS can be efficiently parallelised to solve GCCF using a non-redundant partition of the search space. We benchmark CFSS on both synthetic and realistic scenarios, using a real-world dataset consisting of the energy consumption of a large number of households in the UK. Our results show that, in the best case, the serial version of CFSS is 4 orders of magnitude faster than the state of the art, while the parallel version is 9.44 times faster than the serial version on a 12-core machine. Moreover, CFSS is the first approach to provide anytime approximate solutions with quality guarantees for very large systems of agents (i.e., with more than 2700 agents).Comment: Accepted for publication, cite as "in press

Relaxations and Duality for Multiobjective Integer Programming

Multiobjective integer programs (MOIPs) simultaneously optimize multiple objective functions over a set of linear constraints and integer variables. In this paper, we present continuous, convex hull and Lagrangian relaxations for MOIPs and examine the relationship among them. The convex hull relaxation is tight at supported solutions, i.e., those that can be derived via a weighted-sum scalarization of the MOIP. At unsupported solutions, the convex hull relaxation is not tight and a Lagrangian relaxation may provide a tighter bound. Using the Lagrangian relaxation, we define a Lagrangian dual of an MOIP that satisfies weak duality and is strong at supported solutions under certain conditions on the primal feasible region. We include a numerical experiment to illustrate that bound sets obtained via Lagrangian duality may yield tighter bounds than those from a convex hull relaxation. Subsequently, we generalize the integer programming value function to MOIPs and use its properties to motivate a set-valued superadditive dual that is strong at supported solutions. We also define a simpler vector-valued superadditive dual that exhibits weak duality but is strongly dual if and only if the primal has a unique nondominated point

The core of a class of non-atomic games which arise in economic applications

We study the core of a non-atomic game v which is uniformly continuous with respect to the DNA-topology and continuous at the grand coalition. Such a game has a unique DNA-continuous extension on the space B 1 of ideal sets. We show that if the extension is concave then the core of the game v is non-empty iff is homogeneous of degree one along the diagonal of B 1. We use this result to obtain representation theorems for the core of a non-atomic game of the form v=f where μ is a finite dimensional vector of measures and f is a concave function. We also apply our results to some non-atomic games which occur in economic applications.Publicad

The multiple vehicle balancing problem

This paper deals with the multiple vehicle balancing problem (MVBP). Given a fleet of vehicles of limited capacity, a set of vertices with initial and target inventory levels and a distribution network, the MVBP requires to design a set of routes along with pickup and delivery operations such that inventory is redistributed among the vertices without exceeding capacities, and routing costs are minimized. The MVBP is NP\u2010hard, generalizing several problems in transportation, and arising in bike\u2010sharing systems. Using theoretical properties of the problem, we propose an integer linear programming formulation and introduce strengthening valid inequalities. Lower bounds are computed by column generation embedding an ad\u2010hoc pricing algorithm, while upper bounds are obtained by a memetic algorithm that separate routing from pickup and delivery operations. We combine these bounding routines in both exact and matheuristic algorithms, obtaining proven optimal solutions for MVBP instances with up to 25 stations

On the core of m-attribute games

We study a special class of cooperative games with transferable utility (TU), called (Formula presented.) -attribute games. Every player in an (Formula presented.) -attribute game is endowed with a vector of (Formula presented.) attributes that can be combined in an additive fashion; that is, if players form a coalition, the attribute vector of this coalition is obtained by adding the attributes of its members. Another fundamental feature of (Formula presented.) -attribute games is that their characteristic function is defined by a continuous attribute function (Formula presented.) —the value of a coalition depends only on evaluation of (Formula presented.) on the attribute vector possessed by the coalition, and not on the identity of coalition members. This class of games encompasses many well-known examples, such as queueing games and economic lot-sizing games. We believe that by studying attribute function (Formula presented.) and its properties, instead of specific examples of games, we are able to develop a common platform for studying different situations and obtain more general results with wider applicability. In this paper, we first show the relationship between nonemptiness of the core and identification of attribute prices that can be used to calculate core allocations. We then derive necessary and sufficient conditions under which every (Formula presented.) -attribute game embedded in attribute function (Formula presented.) has a nonempty core, and a set of necessary and sufficient conditions that (Formula presented.) should satisfy for the embedded game to be convex. We also develop several sufficient conditions for nonemptiness of the core of (Formula presented.) -attribute games, which are easier to check, and show how to find a core allocation when these conditions hold. Finally, we establish natural connections between TU games and (Formula presented.) -attribute games.</p

Coalitional manipulations in a bankruptcy problem

In a bankruptcy problem framework we consider rules immune to possible manipulations by the creditors involved in the problem via merging or splitting of their individual claims. The paper provides characterization theorems for the non manipulable rules, the no advantageous merging parametric rules and the no advantageous splitting parametric rules.Publicad