Publications

Under Review/Working Papers | Publications  | Other Writings |

Publications:

Harstad, R.M., and A. Pekec (2008), "Relevance to Practice and Auction Theory: A Memorial Essay for Michael Rothkopf", Interfaces, 38, 367-380.

Pekec, A., and I. Tsetlin (2008) “Revenue Ranking of Discriminatory and Uniform Auctions with an Unknown Number of Bidders”, Management Science, 54, 1610-1623.

Mezzetti, C., A. Pekec and I. Tsetlin (2008) “Sequential vs. Single-Round Uniform Price Auctions.” Games and Economic Behavior, 62, 591-609.

Harstad, R.M., A. Pekec and I. Tsetlin (2008), "Information Aggregation in Auctions with an Unknown Number of Bidders." Games and Economic Behavior, 62, 476-508.

Tsetlin, I., and A. Pekec (2006), “On the Existence of the Symmetric Equilibrium in (k+1)-st Price Common Value Auctions”, Review of Economic Design, 10, 63-71.

Pekec, A., and M.H. Rothkopf (2006) "Noncomputational Approaches to Mitigating Computational Problems in Combinatorial Auctions.” In P. Cramton, Y. Shoham, R. Steinberg (Eds.) Combinatorial Auctions, M.I.T. Press.

Mustafa, N., and A. Pekec (2004), “Listen to Your Neighbors: How (Not) to Reach a Consensus.” SIAM Journal on Discrete Mathematics, 17, 634-660.

Doignon, J.-P., A. Pekec and M. Regenwetter (2004), "The Repeated Insertion Model for Rankings: Missing link between two subset choice models." Psychometrika, 69, 33-54.

Pekec, A., and M.H. Rothkopf (2003), "Combinatorial Auction Design." Management Science, 49, pp. 1485-1503.

Fishburn, P.C., A. Pekec and J.A. Reeds (2002), "Subset Comparisons for Additive Linear Orders", Mathematics of Operations Research, 27, pp.227-243.

Pekec, A. (2001), "Meaningful and Meaningless Solutions for Cooperative N-person Games", European Journal of Operational Research 133/3, pp. 154-169.

Mustafa, N., and A. Pekec (2001), "Majority Consensus and the Local Majority Rule", In Orejas, F., P. G. Spirakis and J. van Leeuwen (Eds.): Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings. Lecture Notes in Computer Science 2076 Springer, pp. 530-542.

Pekec, A. and F.S. Roberts (2001), "The Role Assignment Model Nearly Fits Most Social Networks", Mathematical Social Sciences 41, pp.275-293.

Bermond, J.-C., J. Bond, C. Martin, A. Pekec and F.S. Roberts (2000), "Optimal Orientations of Annular Networks", Journal of Interconnection Networks 1, pp. 21-46.

Rothkopf, M.H., A. Pekec and R.M. Harstad (1998), "Computationally Manageable Combinational Auctions", Management Science 44, pp. 1131-1147.

Mahadev, N.V.R., A. Pekec and F.S. Roberts (1998), "On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Non-Optimal?" Operations Research 46/3S, S120-S134.

Mahadev, N.V.R., A. Pekec and F.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, pp. 9-22.

Pekec, A. (1997), "Optimization under Ordinal Scales: When is a Greedy Solution Optimal?", Mathematical Methods of Operations Research 46, pp. 229-239.

Pekec, A. (1996), "A Winning Strategy for the Ramsey Graph Game", Combinatorics, Probability & Computing 5, pp. 267-276.

Pekec, A. (1996), Limitations on conclusions from combinatorial optimization models, Ph.D. Thesis, Rutgers University.

Papers under review and working papers:

Baucells, M. and A.Pekec, "Assembling Balanced Teams"

Fishburn, P.C., and A. Pekec, “Approval Voting for Committees: Threshold Approaches”

Fishburn, P.C., and A. Pekec, “Bundle Valuations”

Pekec, A., "Optimal Choice and Aggregation in Presence of Ratio Scale Information”

Pekec, A., “Subset Choice, Cooperative Games, and Approval Voting.”

Pekec, A., and M. Regenwetter, "Too Close to Call, On Various Counts”

Other writings:

Pekec, A. (2007), "A Proposal to Improve Auction 73 Procedures", an official filing with the Federal Communications Commission, August 31, 2007.

Harstad R.M., A. Pekec and M.H. Rothkopf (2002), "On Setting Minimum Bids and Calculating Minimum Bid Increments", an official filing with the Federal Communications Commission, February 26, 2002.

Harstad R.M., A. Pekec and M.H. Rothkopf (2002), "Thorough Analysis of Package Bidding Procedures is Still Needed", an official filing with the Federal Communications Commission, February 19, 2002.

Harstad R.M., A. Pekec and M.H. Rothkopf (2001), "Verizon is Right: Delay Auction No. 31", an official filing with the Federal Communications Commission, January 24, 2001.

Pekec, A. (2000) "US Presidential Elections: Fixing the System."

Pekec, A. and M.H. Rothkopf (2000), "Discussion of the Novel Auction Rules Should Not Be Limited to a Few Details", an official filing with the Federal Communications Commission, November 15, 2000

Pekec, A. and M.H. Rothkopf (2000), "Now There is Time for Serious Consideration of the Novel Auction Rules", an official filing with the Federal Communications Commission, August 1, 2000

Pekec, A. and M.H. Rothkopf (2000), "More on Making the FCC's First Combinatorial Auction Work Well", an official filing with the Federal Communications Commission, June 16, 2000

Pekec, A. and M.H. Rothkopf (2000), "Making the FCC's First Combinatorial Auction Work Well", an official filing with the Federal Communications Commission, June 7, 2000

Pekec A. (1996), "Scalings in Linear Programming: Necessary and Sufficient Conditions for Invariance", technical report, BRICS Research Series RS-96-48.

Pekec A. (1996), "Hypergraph Optimization Problems: Why is the Objective Function Linear?", technical report, BRICS Research Series RS-96-50.