Author image not provided
 Sanjiv Kapoor

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article7.08
Citation Count276
Publication count39
Publication years1986-2016
Available for download10
Average downloads per article552.80
Downloads (cumulative)5,528
Downloads (12 Months)316
Downloads (6 Weeks)20
Professional ACM Member
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Advisor only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


39 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 39
Result page: 1 2

Sort by:

1 published by ACM
May 2016 ACM Transactions on Algorithms (TALG): Volume 12 Issue 3, June 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 113,   Downloads (Overall): 231

Full text available: PDFPDF
We give a new mathematical formulation of market equilibria in exchange economies using an indirect utility function : the function of prices and income that gives the maximum utility achievable. The formulation is a convex program and can be solved when the indirect utility function is convex in prices. We ...
Keywords: Market equilibrium, approximation algorithms

2
September 2012 Information Processing and Management: an International Journal: Volume 48 Issue 5, September, 2012
Publisher: Pergamon Press, Inc.
Bibliometrics:
Citation Count: 0

This paper proposes a new scheme for ensuring data consistency in unstructured p2p networks where peers can subscribe to multiple content types (identified by labels) and are rapidly informed of content updates. The idea is based on using a static tree structure, the Cluster-K^+ tree, that maintains most of the ...
Keywords: Overlay networks, Peer-to-peer systems, Scalability, Hierarchy

3
December 2011 WINE'11: Proceedings of the 7th international conference on Internet and Network Economics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

In this paper we consider the problem of computing market equilibrium when utilties are homothetic concave functions. We use the Fisher market model. The problem of finding a tâtonnement process for equilibrium in this case has been the subject of recent papers and determining an approximation is of considerable interest. ...

4
March 2010 INFOCOM'10: Proceedings of the 29th conference on Information communications
Publisher: IEEE Press
Bibliometrics:
Citation Count: 1

In this paper we address the issue of designing multipath routing algorithms. Multi-path routing has the potential of improving the throughput but requires buffers at the destination. Our model assumes a network with capacitated edges and a delay function associated with the network links (edges). We consider the problem of ...

5
December 2009 ISAAC '09: Proceedings of the 20th International Symposium on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

In this paper we consider the problem of efficiently constructing geodesic t -spanners. We consider finding sparse spanners on the surface of a 3 dimensional polyhedron allowing for steiner vertices. If Steiner vertices are not allowed, then we establish lower bounds on the maximum node degree, depending on the spanning ...

6
November 2009 Computational Geometry: Theory and Applications: Volume 42 Issue 9, November, 2009
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 7

In this paper, we consider the problem of computing the region visible to a query point located in a given polygonal domain. The polygonal domain is specified by a simple polygon with m holes and a total of n vertices. We provide two bounds on the complexity of this problem. ...

7
November 2009 Computational Geometry: Theory and Applications: Volume 42 Issue 9, November, 2009
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 9

The rectilinear shortest path problem can be stated as follows: given a set of m non-intersecting simple polygonal obstacles in the plane, find a shortest L"1-metric (rectilinear) path from a point s to a point t that avoids all the obstacles. The path can touch an obstacle but does not ...

8
December 2008 WINE '08: Proceedings of the 4th International Workshop on Internet and Network Economics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

We give a new mathematical formulation of market equilibriausing an <em>indirect utility function</em> : the function of pricesand income that gives the maximum utility achievable. Theformulation is a <em>convex program</em> and can be solved when theindirect utility function is convex in prices. We illustrate thatmany economies including Homogeneous utilities of ...

9
December 2007 WINE'07: Proceedings of the 3rd international conference on Internet and network economics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

In addition to useful Economic interpretation, auction based algorithms are generally found to be efficient. In this note, we observe that the auction-based mechanism can also be used to efficiently compute market equilibrium for a large class of utility functions satisfying gross substitutability, including a range of CES (constant elasticity ...

10
December 2007 FSTTCS'07: Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

The rectilinear shortest path problem can be stated as - given a set of m non-intersecting simple polygonal obstacles in the plane, find a shortest rectilinear ( L 1 ) path from a point s to a point t which avoids all the obstacles. The path can touch an obstacle ...

11
December 2007 Theory of Computing Systems: Volume 41 Issue 4, December 2007
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 4

We present approximation algorithms for two closely related bicriteria problems. Given a graph with two weight functions on the edges, length and cost, we consider the Bounded-Diameter Minimum-Cost Steiner Tree (BDMST) problem and the Bounded-Diameter Minimum-Cardinality Edge Addition (BDMC) problem. We present a parameterized approximation algorithm for the BDMST problem ...

12
June 2007 Theoretical Computer Science: Volume 378 Issue 2, June, 2007
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 3

We present an auction-based algorithm for computing market equilibrium prices in a production model, in which producers have a single linear production constraint, and consumers have linear utility functions. We provide algorithms for both the Fisher and Arrow-Debreu versions of the problem.
Keywords: Market equilibrium, Production, Algorithm, Auction

13
December 2006 WINE'06: Proceedings of the Second international conference on Internet and Network Economics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

In this paper we investigate the structure of prices in approximate solutions to the market equilibrium problem. The bounds achieved allow a scaling approach for computing market equilibrium in the Fisher model. Our algorithm computes an exact solution and improves the complexity of previously known combinatorial algorithms for the problem. ...

14
November 2006 Mathematics of Operations Research: Volume 31 Issue 4, November 2006
Publisher: INFORMS
Bibliometrics:
Citation Count: 7

In this paper we study algorithms for computing market equilibrium in markets with linear utility functions. The buyers in the market have an initial endowment given by a portfolio of goods. The market equilibrium problem is to compute a price vector that ensures market clearing, i.e., the demand of a ...
Keywords: Walrasian model, auction algorithm, market equilibrium

15
June 2006 Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003): Volume 154 Issue 9, 1 June 2006
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 2

Motivated by topology control in ad hoc wireless networks, Power Assignment is a family of problems, each defined by a certain connectivity constraint (such as strong connectivity). The input consists of a directed complete weighted digraph G = ( V, c ) (that is, c : V × V → ...
Keywords: bicriteria approximation, ad hoc wireless networks, topology control, approximation algorithms

16
December 2005 WINE'05: Proceedings of the First international conference on Internet and Network Economics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We present an auction-based algorithm for the computing market equilibrium prices in a production model, in which producers have a single linear production constraint, and consumers have linear utility functions. We provide algorithms for both the Fisher and Arrow-Debreu versions of the problem.

17 published by ACM
June 2004 STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 34
Downloads (6 Weeks): 2,   Downloads (12 Months): 11,   Downloads (Overall): 836

Full text available: PDFPDF
In this paper we study algorithms for computing market equilibrium in markets with linear utility functions. The buyers in the market have an initial endowment given by a portfolio of items. The market equilibrium problem is to compute a price vector which ensures market clearing, i. e. the demand of ...
Keywords: market equilibrium, approximation algorithms, auction algorithms

18
December 2001 HiPC '01: Proceedings of the 8th International Conference on High Performance Computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 6

Current web server farms have simple resource allocation models. One model used is to dedicate a server or a group of servers for each customer. Another model partitions physical servers into logical servers and assigns one to each customer. Yet another model allows customers to be active on multiple servers ...

19
May 2000 SIAM Journal on Computing: Volume 30 Issue 3, 2000
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 5

This paper describes an output-sensitive scheme to construct the visibility graph of a simple polygon with m obstacles and n vertices in optimal O (| E | + T + m log n ) time where | E | is the size of the visibility graph and T is the ...
Keywords: obstacles, visibility graph, simple polygon, linked lists, output-sensitive, triangulation

20
April 2000 SIAM Journal on Computing: Volume 29 Issue 6, April 2000
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 13

This paper describes an efficient scheme for the dynamic maintenance of the set of maxima of a 2-d set of points. Using the fact that the maxima can be stored in a staircase structure, we use a technique in which we maintain approximations to the staircase structure. We first describe ...
Keywords: balanced trees, dynamic maintenance, maximal points



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us