Aleksandar Pekec

According to our database, Aleksandar Pekec authored at least 10 papers between 1996 and 2004.

Collaborative distances:

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

2004

Listen to Your Neighbors: How (Not) to Reach a Consensus.

Nabil H. Mustafa, Aleksandar Pekec

SIAM J. Discret. Math., 2004

2003

Combinatorial Auction Design.

Aleksandar Pekec, Michael H. Rothkopf

Manag. Sci., 2003

2002

Subset Comparisons for Additive Linear Orders.

Peter C. Fishburn, Aleksandar Pekec, James A. Reeds

Math. Oper. Res., 2002

2001

The role assignment model nearly fits most social networks.

Aleksandar Pekec, Fred S. Roberts

Math. Soc. Sci., 2001

Meaningful and meaningless solutions for cooperative n-person games.

Aleksandar Pekec

Eur. J. Oper. Res., 2001

Majority Consensus and the Local Majority Rule.

Nabil H. Mustafa, Aleksandar Pekec

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Optimal Orientations of Annular Networks.

Jean-Claude Bermond, Johny Bond, Carole Martin, Aleksandar Pekec, Fred S. Roberts

J. Interconnect. Networks, 2000

1998

On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?

Nadimpalli V. R. Mahadev, Aleksandar Pekec, Fred S. Roberts

Oper. Res., 1998

1997

Optimization under ordinal scales: When is a greedy solution optimal?

Aleksandar Pekec

Math. Methods Oper. Res., 1997

1996

A Winning Strategy for the Ramsey Graph Game.

Aleksandar Pekec

Comb. Probab. Comput., 1996