A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Distributed Convex Optimization with Inequality Constraints over Time-varying Unbalanced Digraphs
[article]

2016
*
arXiv
*
pre-print

This paper considers

arXiv:1612.09029v1
fatcat:pwvi3ugq2vcrxhs3o2kmz2rooa
*a**distributed*convex*optimization*problem with inequality constraints*over*time-varying unbalanced*digraphs*, where the cost function is*a*sum of local objectives, and each node of ... We prove that if the graph is uniformly jointly*strongly**connected*, each node asymptotically converges to some common*optimal*solution. ... Again, it is unclear how to use the "*surplus*-*based*" idea to solve the*distributed**optimization*problem*over*time-varying unbalanced*digraphs*. ...##
###
GREEN-PSO: Conserving Function Evaluations in Particle Swarm Optimization

english

2013
*
Proceedings of the 5th International Joint Conference on Computational Intelligence
*

english

The "

doi:10.5220/0004555501600167
dblp:conf/ijcci/Majercik13
fatcat:sgsrpadmovg65h6dxjsorgf4j4
*surplus*" of function evaluations thus created allows*a*greater number of particles and/or iterations. ... In the Particle Swarm*Optimization*(PSO) algorithm, the expense of evaluating the objective function can make it difficult, or impossible, to use this*approach*effectively; reducing the number of necessary ... If these*digraphs*are*strongly**connected**over*time, i.e. if there is*a*fixed interval such that the union of the*digraphs**over*every interval of iterations of that length is*strongly**connected*, then information ...##
###
Distributed Proximal Algorithms for Multi-Agent Optimization with Coupled Inequality Constraints
[article]

2020
*
arXiv
*
pre-print

This paper aims to address

arXiv:1907.03245v2
fatcat:g6cinqfypbfv7ie2uvikij4kaa
*distributed**optimization*problems*over*directed and time-varying networks, where the global objective function consists of*a*sum of locally accessible convex objective functions ... For this problem,*a**distributed*proximal-*based*algorithm, called*distributed*proximal primal-dual (DPPD) algorithm, is proposed*based*on the celebrated centralized proximal point algorithm. ...*A*graph is called*strongly**connected*if any node can be*connected*to any other node by*a*directed path, where*a*directed path means*a*sequence of directed adjacent edges. ...##
###
Randomized Gradient-Free Distributed Online Optimization via a Dynamic Regret Analysis
[article]

2021
*
arXiv
*
pre-print

This work considered an online

arXiv:1903.07106v5
fatcat:mr32hkvebnfufpxgge2qyoxb3u
*distributed**optimization*problem, with*a*group of agents whose local objective functions vary with time. ... To solve this problem, an online gradient-free*distributed*projected gradient descent (DPGD) algorithm is presented, where each agent locally approximates the gradient*based*on two point values. ... In particular, we consider the following*distributed*online*optimization*problem with 10 agents*over**a**strongly**connected**digraph*as shown in Fig. 1 : min f t (x) = 10 i=1 f t i (x), x ∈ Ω, where f t ...##
###
The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

2013
*
European Journal of Operational Research
*

EWO involves

doi:10.1016/j.ejor.2012.08.016
fatcat:c27kagfnxnhjfbil2rydhjhomm
*optimizing*the operations of supply, production and*distribution*activities of*a*company to reduce costs and inventories. ... -Assessing the profitability of carsharing fleet*distributions**based*on usage patterns Mathias Goeppel, GR/PAP, Daimler AG, Building 10, Room 2.3.036, One-way carsharing as seen with car2go, where vehicle ... -*Optimal*Dynamic Tax Evasion:*A*Portfolio*Approach*Francesco Menoncin, Economics, Brescia University, Via S. Faustino, 74/B, 25122, Brescia, Italy, menoncin@eco.unibs.it, Rosella Levaggi ...##
###
Multi-Objective Optimization for Cyber-Physical-Social Systems: A Case Study of Electric Vehicles Charging and Discharging

2019
*
IEEE Access
*

First, the

doi:10.1109/access.2019.2921716
fatcat:xn5ojcw5urfxbdpuhb5uphygay
*optimal*scheduling problem is formulated as*a*multi-objective*optimization*problem with system's technical constraints, and then*a*hierarchical*optimal*algorithm is proposed to solve the problem ... Further, this paper combines the proposed algorithm with*a*moving horizon method to deal with the EV owners random arrival and departure case*based*on the owners' convenience and preferences. ... Lemma 3 is about the*optimal*consensus-*based*iteration for dynamic*resource**allocation*problem [29] . ...##
###
Network Pollution Games

2018
*
Algorithmica
*

For trees we design

doi:10.1007/s00453-018-0435-4
pmid:30872881
pmcid:PMC6390722
fatcat:bf4j6z7fljbt3owyfkrsdi46qy
*a*two level dynamic programming*approach*to obtain an FPTAS. This*approach*is crucial to deal with the global pollution quota constraint. ... We first prove that the above*optimization*problem is NP-hard even on some special cases of graphs such as trees. ...*Based*on the above DP*approach*, we can solvePG 2 on any k-outerplanar graph*optimally*for any fixed k (which includes any directed tree whose treewidth is 2). ...##
###
A Strategic Model of Social and Economic Networks
[chapter]

2003
*
Networks and Groups
*

Next, we show that this tension persists generally: to assure that there exists

doi:10.1007/978-3-540-24790-6_3
fatcat:psnyxypbl5hmng2hdf42zwpkzi
*a*stable network that is efficient, one is forced to*allocate**resources*to nodes that are not responsible for any of the ... There does not always exist*a*stable network that is efficient. ... See Dutta et al. [3] for*a*discussion of this*approach*and an alternative*approach**based*on coalition-proof Nash equilibrium. ...##
###
A Strategic Model of Social and Economic Networks

1996
*
Journal of Economic Theory
*

Next, we show that this tension persists generally: to assure that there exists

doi:10.1006/jeth.1996.0108
fatcat:6lsdf3nmvrhqbjcx44wvcduswm
*a*stable network that is efficient, one is forced to*allocate**resources*to nodes that are not responsible for any of the ... There does not always exist*a*stable network that is efficient. ... See Dutta et al. [3] for*a*discussion of this*approach*and an alternative*approach**based*on coalition-proof Nash equilibrium. ...##
###
The navigability of strong ties: Small worlds, tie strength, and network topology

2002
*
Complexity
*

Padgett's commentary, as on

doi:10.1002/cplx.10053
fatcat:2h2wn33am5dj5lo7eolegvyuni
*a*related article by Powell, White, Koput and Owen-Smith, has been consistently helpful, as have discussions with researchers at the Santa Fe Institute, too many to name individually ... Firms show*a*power-law*distribution*of degree*connectivity*. ... The study of network topology using the Eckmann and Moses curvature methods showed how an*optimal*small world with searchability (SW wS ) would follow from self-organizing locally*based*or*distributed*...##
###
Sharing the cost of multicast transmissions in wireless networks

2006
*
Theoretical Computer Science
*

covers the overall cost and is at most times the

doi:10.1016/j.tcs.2006.09.004
fatcat:dn3yqiglfrdxphsxennye2npxa
*optimal*one, while it is efficient if it maximizes the sum of the receivers' utilities minus the total cost*over*all receivers' sets. ...*A*provider can discourage such deceptions by using*a*strategyproof cost sharing mechanism, that is*a*particular public algorithm that, by forcing the agents to truthfully reveal their utility, starting ... Since in wireless networks energy is*a*scarce*resource*and establishing*a*communication pattern*strongly*depends on the energy consumption,*a*natural question to be solved is to guarantee*a*communication ...##
###
Sharing the Cost of Multicast Transmissions

2001
*
Journal of computer and system sciences (Print)
*

The lower-bound proof for the Shapley value uses

doi:10.1006/jcss.2001.1754
fatcat:dbewgbroufchlhrt5pgm64fzty
*a*novel algebraic technique for bounding from below the number of messages exchanged in*a**distributed*computation; this technique may prove useful in other ... We also show that the welfare value achieved by an*optimal*multicast tree is NP-hard to approximate within any constant factor, even for bounded-degree networks. ... We next show*a*result*strongly*suggesting that the brute-force algorithm is essentially*optimal*, i.e., that such quadratic dependence is inherent. ...##
###
Chapter 5 The Economic Theory of Gift-Giving: Perfect Substitutability of Transfers and Redistribution of Wealth
[chapter]

2006
*
Handbook of the Economics of Giving, Altruism and Reciprocity
*

Section 3 gives

doi:10.1016/s1574-0714(06)01005-0
fatcat:vrffbzuh7bcylfumtr6lspe72y
*a*first formal version of the theory in*a*one-commodity setup (pure*distributive*social system). ... 3, where the set of agents is partitioned in two subsets, namely,*a*subset of "poor" individuals with zero endowments and egoistic preferences, and*a*subset of "rich" individuals altruistic to the poor ... private transfers. 46*A**connected*component of*digraph*γ is*a**connected*subdigraph of γ that is*a*proper subdigraph of no*connected*subdigraph of γ . ...##
###
The Cohesiveness of Blocks In Social Networks: Node Connectivity and Conditional Density

2001
*
Sociological methodology
*

Conditional density measures cohesion on

doi:10.1111/0081-1750.00098
fatcat:dbe5pgfkw5dlbcmsnryijrto7m
*a*finer scale as*a*proportion of ties beyond that required for*connectivity*k*over*the number of ties that would force it to k ϩ 1. ... If network cohesion is enhanced by multiple*connections*between members of*a*group, for example, then the higher the global minimum of the number of independent paths that*connect*every pair of nodes in ... Harary and Cartwright (1961) on the number of arcs in each*connectedness*category of*a**digraph*. 35 See Harary (1969:17-19) for an introduction to extremal graphs. ...##
###
Abstracts of Working Papers in Economics

1991
*
Abstracts of Working Papers in Economics
*

As it turns out, expectations follow

doi:10.1017/s0951007900002175
fatcat:3aiihzle2jdg7ejek4kp2rwqci
*a**distributed*lag model. In the empirical part this expectation model is esumated within the Fisher equation and the theoretical restrictions are tested. ... The result is*based*on new data which reveal high rates of labor turnover in the footwear sector and so imply that displaced labor is readily re-employed. ... However, there is*a*range of*distributions*of*resources**over*which neither region makes transfers. ...
« Previous

*Showing results 1 — 15 out of 52 results*