#### Filter Results:

- Full text PDF available (60)

#### Publication Year

2003

2017

- This year (7)
- Last 5 years (29)
- Last 10 years (66)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Lacra Pavel
- Automatica
- 2007

This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solving directly such a coupled NG requires coordination among possibly all players. An alternative approach is proposed based on its relation to a special constrained optimization… (More)

- Yan Pan, Tansu Alpcan, Lacra Pavel
- IEEE Trans. Communications
- 2010

This paper studies a constrained optical signal-tonoise ratio (OSNR) optimization problem in optical networks from the perspective of system performance. A system optimization problem is formulated with the objective of achieving an OSNR target for each channel while satisfying the total power constraint. In order to establish existence of a unique optimal… (More)

- Quanyan Zhu, Lacra Pavel
- IEEE Trans. Communications
- 2009

This paper considers a generalized framework to study OSNR optimization-based end-to-end link level power control problems in optical networks. We combine favorable features of game-theoretical approach and central cost approach to allow different service groups within the network. We develop solutions concepts for both cases of empty and nonempty feasible… (More)

- Yan Pan, Lacra Pavel
- Automatica
- 2009

We consider games in optical networks in the class of m-player games with coupled utilities and constraints. Nash equilibria of such games can be computed based on recent extension of duality to a game theoretical framework. This work extends previous results on games with coupled constraints in optical links to multi-link topologies. Coupled constraints in… (More)

This paper addresses the problem of optimization of optical signal to noise ratio (OSNR) in optical communication networks. The OSNR optimization problem is formulated as an m-player noncooperative game, based on a network OSNR model, developed for a general multi-link configuration. Conditions for existence and uniqueness of the game equilibrium solution… (More)

- Farzad Salehisadaghiani, Lacra Pavel
- CDC
- 2014

In this paper an asynchronous gossip-based algorithm is proposed for finding a Nash equilibrium of a game in a distributed multi-player network. The algorithm is designed in such a way that the players’ actions are updated based on the estimates of the other players’ actions which are obtained from the local neighbors. The almost sure convergence proof of… (More)

- Karla Kvaternik, Lacra Pavel
- CDC
- 2012

- Tansu Alpcan, Lacra Pavel
- 2009 International Conference on Game Theory for…
- 2009

The general problem of Nash equilibrium design is investigated from an optimization perspective. Within this context, a specific but fairly broad class of noncooperative games are considered that have been applied to a variety of settings including network congestion control, wireless uplink power control, and optical power control. The Nash equilibrium… (More)

- Farzad Salehisadaghiani, Lacra Pavel
- Automatica
- 2016

This paper presents an asynchronous gossip-based algorithm for finding aNash equilibrium (NE) of a game in a distributedmulti-player network. The algorithm is designed in such away that playersmake decisions based on estimates of the other players’ actions obtained from local neighbors. Using a set of standard assumptions on the cost functions and… (More)

- Farzad Salehisadaghiani, Lacra Pavel
- CDC
- 2016

We consider a gossip approach for finding a Nash equilibrium in a distributed multi-player network game. We extend previous results on Nash equilibrium seeking to the case when the players’ cost functions may be affected by the actions of any subset of players. An interference graph is employed to illustrate the partially-coupled cost functions and the… (More)