Network Optimization with Heuristic Rational Agents Conference Paper

abstract

• We study a distributed model for optimizing a sum of convex objective functions corresponding to agents in the network. At random times, agents execute actions based on heuristic rational rules considering only local information. Heuristic rational rules are probabilistic and their expectation yields the actual optimal action. Under heuristic rational rule iterations, it is shown that global network cost comes within a close vicinity of the optimal value infinitely often with probability 1. Furthermore, an exponential bound on probability of deviating from vicinity of the optimal value is derived. We exemplify heuristic rational behavior on estimation of a random field using a wireless sensor network. 2011 IEEE.

name of conference

• 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)

authors

• Eksin, Ceyhun

published proceedings

• 2011 CONFERENCE RECORD OF THE FORTY-FIFTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS (ASILOMAR)

author list (cited authors)

• Eksin, C., & Ribeiro, A.

citation count

• 1

complete list of authors

• Eksin, Ceyhun||Ribeiro, Alejandro

publication date

• November 2011

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Conference record / Asilomar Conference on Signals, Systems & Computers. Asilomar Conference on Signals, Systems & Computers  Journal

Digital Object Identifier (DOI)

• 10.1109/acssc.2011.6189953

International Standard Book Number (ISBN) 13

• 9781467303231

start page

• 53

end page

• 57

URL

• http://dx.doi.org/10.1109/acssc.2011.6189953