Results 1  10
of
213
Submodularity Helps in Nash and Nonsymmetric Bargaining
"... Motivated by recent insights on the two solution concepts of Nash and nonsymmetric bargaining games, obtained from an algorithmic study of these notions [Vaz09], we take a fresh look at understanding their quality and robustness by subjecting them to several “stress tests”. Our tests are quite basic ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Motivated by recent insights on the two solution concepts of Nash and nonsymmetric bargaining games, obtained from an algorithmic study of these notions [Vaz09], we take a fresh look at understanding their quality and robustness by subjecting them to several “stress tests”. Our tests are quite
2Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
"... The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2player game whose convex program has linear constraints, admits a rational solution and such a solution can be fo ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2player game whose convex program has linear constraints, admits a rational solution and such a solution can
Nash bargaining via flexible budget markets
, 2009
"... We initiate a study of Nash bargaining games [Nas50] via combinatorial, polynomial time algorithms and we carry this program over to solving nonsymmetric bargaining games of Kalai [Kal77] as well. Since the solution to a Nash bargaining game is also the optimal solution to the corresponding convex p ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We initiate a study of Nash bargaining games [Nas50] via combinatorial, polynomial time algorithms and we carry this program over to solving nonsymmetric bargaining games of Kalai [Kal77] as well. Since the solution to a Nash bargaining game is also the optimal solution to the corresponding convex
Rational convex programs and efficient algorithms for 2player Nash and nonsymmetric bargaining games
 In 3rd International Symposium on Algorithmic Game Theory
, 2010
"... The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2player game whose convex program has linear constraints, admits a rational solution and such a solution can be fo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2player game whose convex program has linear constraints, admits a rational solution and such a solution can
Rational Convex Programs, Their Feasibility, and the ArrowDebreu Nash Bargaining Game
"... Over the last decade, combinatorial algorithms have been obtained for exactly solving several nonlinear convex programs. We first provide a formal context to this activity by introducing the notion of rational convex programs – this also enables us to identify a number of questions for further study ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
bargaining game, called ADNB, which is derived from the linear case of the ArrowDebreu market model. We reduce this game to computing an equilibrium in a new market model called flexible budget market, and we obtain primaldual algorithms for determining feasibility, as well as giving a proof
Nash Bargaining with Asymmetric Bargaining Power: Bargaining over Profit in a Simple Supply Chain
"... In this note we apply a Nash bargaining model with nonsymmetric bargaining power to negotiation over profit division within a simple supply chain. We show that this bargaining leads to a profit sharing in proportion to the bargaining power within the chain. We also discuss a few implications of thi ..."
Abstract
 Add to MetaCart
In this note we apply a Nash bargaining model with nonsymmetric bargaining power to negotiation over profit division within a simple supply chain. We show that this bargaining leads to a profit sharing in proportion to the bargaining power within the chain. We also discuss a few implications
The Notion of a Rational Convex Program, and an Algorithm for the ArrowDebreu Nash Bargaining Game
, 2012
"... We introduce the notion of a rational convex program (RCP) and we classify the known RCPs into two classes: quadratic and logarithmic. The importance of rationality is that it opens up the possibility of computing an optimal solution to the program via an algorithm that is either combinatorial or us ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
or uses an LPoracle. Next, from the linear case of the ArrowDebreu market model, we define a new Nash bargaining game, which we call ADNB. We show that the convex program for ADNB is a logarithmic RCP, but unlike other known members of this class, it is nontotal. Our main result is a combinatorial
Calculus of Bargaining Solution on Boolean Tables
, 2003
"... This article reports not only a theoretical solution of bargaining problem as used by game theoreticians but also an adequate calculus. By adequate calculus we understand an algorithm that can lead us to the result within reasonable timetable using either the computing power of nowadays computers or ..."
Abstract
 Add to MetaCart
This article reports not only a theoretical solution of bargaining problem as used by game theoreticians but also an adequate calculus. By adequate calculus we understand an algorithm that can lead us to the result within reasonable timetable using either the computing power of nowadays computers
Results 1  10
of
213