Nir Andelman

According to our database, Nir Andelman authored at least 9 papers between 2003 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Competitive Equilibria with Unequal Budgets: Supporting Arbitrary Pareto Optimal Allocations.

Nir Andelman, Michal Feldman, Amos Fiat, Yishay Mansour

CoRR, 2021

2007

Strong price of anarchy.

Nir Andelman, Michal Feldman, Yishay Mansour

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Online and strategic aspects of network resource management algorithms

Nir Andelman

PhD thesis, 2006

A sufficient condition for truthfulness with single parameter agents.

Nir Andelman, Yishay Mansour

Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

2005

Truthful Approximation Mechanisms for Scheduling Selfish Related Machines.

Nir Andelman, Yossi Azar, Motti Sorani

Proceedings of the STACS 2005, 2005

Randomized queue management for DiffServ.

Nir Andelman

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

2004

Auctions with Budget Constraints.

Nir Andelman, Yishay Mansour

Proceedings of the Algorithm Theory, 2004

2003

Competitive Management of Non-preemptive Queues with Multiple Values.

Nir Andelman, Yishay Mansour

Proceedings of the Distributed Computing, 17th International Conference, 2003

Competitive queueing policies for QoS switches.

Nir Andelman, Yishay Mansour, An Zhu

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003