Aleksandar Pekeč

1.6k total citations · 1 hit paper
19 papers, 1.0k citations indexed

About

Aleksandar Pekeč is a scholar working on Computer Networks and Communications, Management Science and Operations Research and Industrial and Manufacturing Engineering. According to data from OpenAlex, Aleksandar Pekeč has authored 19 papers receiving a total of 1.0k indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computer Networks and Communications, 7 papers in Management Science and Operations Research and 6 papers in Industrial and Manufacturing Engineering. Recurrent topics in Aleksandar Pekeč's work include Consumer Market Behavior and Pricing (5 papers), Scheduling and Optimization Algorithms (5 papers) and Auction Theory and Applications (5 papers). Aleksandar Pekeč is often cited by papers focused on Consumer Market Behavior and Pricing (5 papers), Scheduling and Optimization Algorithms (5 papers) and Auction Theory and Applications (5 papers). Aleksandar Pekeč collaborates with scholars based in United States, Denmark and France. Aleksandar Pekeč's co-authors include Michael H. Rothkopf, Ronald M. Harstad, Michel Regenwetter, Nabil H. Mustafa, Fred S. Roberts, Ilia Tsetlin, N. V. R. Mahadev, Peter C. Fishburn, James A. Reeds and Jean‐Claude Bermond and has published in prestigious journals such as Management Science, European Journal of Operational Research and Operations Research.

In The Last Decade

Aleksandar Pekeč

18 papers receiving 927 citations

Hit Papers

Computationally Manageable Combinational Auctions 1998 2026 2007 2016 1998 200 400 600
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Computationally Manageable Combinational Auctions
    1998 663 citations Michael H. Rothkopf, Aleksandar Pekeč et al. Management Science profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Aleksandar Pekeč United States 10 839 433 296 265 179 19 1.0k
Sven de Vries Germany 11 698 0.8× 346 0.8× 274 0.9× 215 0.8× 159 0.9× 27 1.0k
Amy Greenwald United States 20 907 1.1× 439 1.0× 201 0.7× 211 0.8× 200 1.1× 63 1.3k
Moshe Babaioff United States 21 1.2k 1.4× 475 1.1× 520 1.8× 202 0.8× 273 1.5× 69 1.5k
Amir Ronen Israel 10 1.1k 1.3× 363 0.8× 726 2.5× 92 0.3× 376 2.1× 15 1.5k
Balasubramanian Sivan United States 12 605 0.7× 306 0.7× 264 0.9× 101 0.4× 108 0.6× 38 723
Brendan Lucier United States 17 629 0.7× 300 0.7× 333 1.1× 67 0.3× 237 1.3× 75 991
Shahar Dobzinski Israel 21 878 1.0× 360 0.8× 465 1.6× 76 0.3× 372 2.1× 50 1.1k
Hamid Nazerzadeh United States 15 480 0.6× 427 1.0× 219 0.7× 334 1.3× 71 0.4× 38 782
Renato Paes Leme United States 17 695 0.8× 421 1.0× 139 0.5× 103 0.4× 178 1.0× 65 858
S. Matthew Weinberg United States 15 600 0.7× 430 1.0× 216 0.7× 145 0.5× 135 0.8× 52 867

Countries citing papers authored by Aleksandar Pekeč

Since Specialization
Citations

This map shows the geographic impact of Aleksandar Pekeč's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Aleksandar Pekeč with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Aleksandar Pekeč more than expected).

Fields of papers citing papers by Aleksandar Pekeč

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Aleksandar Pekeč. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Aleksandar Pekeč. The network helps show where Aleksandar Pekeč may publish in the future.

Co-authorship network of co-authors of Aleksandar Pekeč

This figure shows the co-authorship network connecting the top 25 collaborators of Aleksandar Pekeč. A scholar is included among the top collaborators of Aleksandar Pekeč based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Aleksandar Pekeč. Aleksandar Pekeč is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

19 of 19 papers shown
1.
Pekeč, Aleksandar & Ilia Tsetlin. (2008). Revenue Ranking of Discriminatory and Uniform Auctions with an Unknown Number of Bidders. Management Science. 54(9). 1610–1623. 13 indexed citations
2.
Harstad, Ronald M. & Aleksandar Pekeč. (2008). Relevance to Practice and Auction Theory: A Memorial Essay for Michael Rothkopf. INFORMS Journal on Applied Analytics. 38(5). 367–380. 6 indexed citations
3.
Pekeč, Aleksandar, et al.. (2004). The Repeated Insertion Model for Rankings: Missing Link between Two Subset Choice Models. Psychometrika. 69(1). 33–54. 45 indexed citations
4.
Mustafa, Nabil H. & Aleksandar Pekeč. (2004). Listen to Your Neighbors: How (Not) to Reach a Consensus. SIAM Journal on Discrete Mathematics. 17(4). 634–660. 13 indexed citations
5.
Pekeč, Aleksandar & Michael H. Rothkopf. (2003). Combinatorial Auction Design. Management Science. 49(11). 1485–1503. 202 indexed citations
6.
Fishburn, Peter C., Aleksandar Pekeč, & James A. Reeds. (2002). Subset Comparisons for Additive Linear Orders. Mathematics of Operations Research. 27(1). 227–243. 9 indexed citations
7.
Pekeč, Aleksandar. (2001). Meaningful and meaningless solutions for cooperative n-person games. European Journal of Operational Research. 133(3). 608–623. 7 indexed citations
8.
Pekeč, Aleksandar & Fred S. Roberts. (2001). The role assignment model nearly fits most social networks. Mathematical Social Sciences. 41(3). 275–293. 11 indexed citations
9.
Mustafa, Nabil H. & Aleksandar Pekeč. (2000). Democratic Consensus and the Local Majority Rule. BRICS Report Series. 7(8). 9 indexed citations
10.
Bermond, Jean‐Claude, et al.. (2000). OPTIMAL ORIENTATIONS OF ANNULAR NETWORKS. Journal of Interconnection Networks. 1(1). 21–46. 1 indexed citations
11.
Rothkopf, Michael H., Aleksandar Pekeč, & Ronald M. Harstad. (1998). Computationally Manageable Combinational Auctions. Management Science. 44(8). 1131–1147. 663 indexed citations breakdown →
12.
Mahadev, N. V. R., Aleksandar Pekeč, & Fred S. Roberts. (1998). On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?. Operations Research. 46(3-supplement-3). S120–S134. 10 indexed citations
13.
Mahadev, N. V. R., Aleksandar Pekeč, & Fred S. Roberts. (1997). Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties. Mathematical and Computer Modelling. 25(11). 9–22. 5 indexed citations
14.
Pekeč, Aleksandar. (1997). Optimization under ordinal scales: When is a greedy solution optimal?. Mathematical Methods of Operations Research. 46(2). 229–239. 1 indexed citations
15.
Pekeč, Aleksandar. (1996). A Winning Strategy for the Ramsey Graph Game. Combinatorics Probability Computing. 5(3). 267–276. 19 indexed citations
16.
Pekeč, Aleksandar. (1996). Meaningful and Meaningless Solutions for Cooperative N-person Games. BRICS Report Series. 3(47). 1 indexed citations
17.
Pekeč, Aleksandar. (1996). Hypergraph Optimization Problems: Why is the Objective Function Linear?. BRICS Report Series. 3(50). 4 indexed citations
18.
Pekeč, Aleksandar. (1996). Scalings in Linear Programming: Necessary and Sufficient Conditions for Invariance. BRICS Report Series. 3(48). 5 indexed citations
19.
Mahadev, N. V. R., Aleksandar Pekeč, & Fred S. Roberts. (1995). Single Machine Scheduling with Earliness and Tardiness Penalties: When is an Optimal Solution Not Optimal?.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Sven de Vries Breakdown of academic impact, for papers by Amy Greenwald Breakdown of academic impact, for papers by Moshe Babaioff Breakdown of academic impact, for papers by Amir Ronen Breakdown of academic impact, for papers by Balasubramanian Sivan Breakdown of academic impact, for papers by Brendan Lucier Breakdown of academic impact, for papers by Shahar Dobzinski Breakdown of academic impact, for papers by Hamid Nazerzadeh Breakdown of academic impact, for papers by Renato Paes Leme Breakdown of academic impact, for papers by S. Matthew Weinberg
Rankless by CCL
2026