Xiaotie Deng, Toshihide Ibaraki, and Hiroshi Nagamochi. Algorithms and complexity in combinatorial optimization games. SODA 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Complexity of Determining Nonemptiness of the Core - Conitzer, Sandholm (2002) (3 citations) (Correct)
.... study games where the players are nodes of a graph with weights on the edges, and the value of a coalition is determined by the total weight of the edges contained in it [Deng and Papadimitriou, 1994] Deng et al. study an integer programming formulation which captures many games on graphs [Deng et al. 1997] . All of those results depend heavily on concise game representations which are specific to the game families under study. Typically, such a family of games is played on a combinatorial structure. Cooperative games on combinatorial structures have been systematically studied [Bilbao, 2000] As ....
Xiaotie Deng, Toshihide Ibaraki, and Hiroshi Nagamochi. Algorithms and complexity in combinatorial optimization games. SODA 1997.
On the Core of the Multicommodity Flow Game - Markakis, Saberi (2003) (2 citations) (Correct)
....trac. Using a similar argument as before, we show that if ASes compensate each other according to these shadow prices, the resulting payo allocation is in the core. The use of dual variables for producing an allocation in the core goes back to the classic Bondareva Shapley theorem [2, 27] In [3, 5, 12, 13, 15, 16, 24, 28] classes of games are de ned in which a core allocaton is obtained as a function of the dual variables. In fact if the demand constraints are dropped and all the nodes have unit capacity then the non emptiness of the core in the multicommodity ow game with transferable payo follows from Theorem ....
....of games are de ned in which a core allocaton is obtained as a function of the dual variables. In fact if the demand constraints are dropped and all the nodes have unit capacity then the non emptiness of the core in the multicommodity ow game with transferable payo follows from Theorem 1 in [5]. For facility location games [3, 12] show that the dual of the facility location problem is equivalent to the problem of nding core allocations if there is no integrality gap. In some games, e.g. 28] every allocation in the core is obtained via a dual solution. However this is not the case in ....
[Article contains additional citation context not shown here]
X. Deng, T. Ibaraki, H. Nagamochi. Algorithms and Complexity in Combinatorial Optimization Games. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 1997.
Complexity of Determining Nonemptiness of the Core - Conitzer, Sandholm (2002) (3 citations) (Correct)
.... games [9] Deng and Papadimitriou study games where the players are nodes of a graph with weights on the edges, and the value of a coalition is determined by the total weight of the edges contained in it [7] Deng et al. study an integer programming formulation which captures many games on graphs [6]. All of those results depend heavily on concise game representations which are specific to the game families under study. As a point of deviation, we study a natural representation that can cap ture any characteristic form game Conciseness in our representation stems only from the fact that in ....
Xiaotie Deng, Toshihide Ibaraki, and Hiroshi Nagamochi. Algorithms and complexity in combinatorial optimization games. In Proceedings of the Eighth Annual A CM-SIAM Symposium on Discrete Algorithms, 1997.
Complexity of Determining Nonemptiness of the Core - Vincent Conitzer And (2002) (3 citations) (Correct)
No context found.
Xiaotie Deng, Toshihide Ibaraki, and Hiroshi Nagamochi. Algorithms and complexity in combinatorial optimization games. SODA 1997.
Complexity of Constructing Solutions in the Core Based on.. - Conitzer, Sandholm (2006) (Correct)
No context found.
Deng, X., Ibaraki, T., Nagamochi, H., 1997. Algorithms and complexity in combinatorial optimization games. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 720--729.
Lower Bounds for Cost Sharing and Group-Strategyproof.. - Immorlica, Mahdian.. (1 citation) (Correct)
No context found.
X. Deng, T. Ibaraki, and H. Nagamochi. Algorithms and complexity in combinatorial optimization games. In SODA, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC