We study how to improve sequential single-item auctions that assign targets to robots for exploration tasks such as environmental clean-up, space-exploration, and search and rescue missions. We exploit the insight that the resulting travel distances are small if the bidding and winner-determination rules are designed to result in hillclimbing, namely to assign an additional target to a robot in...

Cockroaches respond to the approach of a predator by turning away and then running. Three bilateral pairs of giant interneurons are involved in determining the direction of the sensory stimulus and setting the turn direction. Each of these six interneurons has a different directional response to wind stimuli. We have tested whether these six cells use a winner-take-all mechanism to perform this...

We study auction-like algorithms for the distributed allocation of tasks to cooperating agents. To reduce the team cost of sequential single-item auction algorithms, we generalize them to assign more than one additional task during each round, which increases their similarity to combinatorial auction algorithms. We show that, for a given number of additional tasks to be assigned during each rou...

We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determination problem); (2) deciding whether a given agent can influence the outcome of a judgment aggregation procedure in her favour by reporting insincere judgments (the strategic manipulation problem); and (3) deciding whet...

In this paper we develop algorithms for efficiently processing bids in a single item, N unit ( N ≥ 1) open cry auction for a large class of winner determination rules. Existing techniques consider all previously submitted bids along with the new arrivals to update the current set of winners. We propose that at most N “potential winner bids” amongst the previously submitted bids need to be used ...

Recently, researchers have proposed decision support tool for generating suggestions for bids in combinatorial reverse auction based on disclosure of bids. An interesting issue is to design an effective mechanism to guide the bidders to collectively minimize the overall cost without explicitly disclosing the bids. We consider a winner determination problem for combinatorial reverse auction and ...

This paper presents a novel incentive-based load shedding management scheme within microgrid environment equipped with the required IoT infrastructure. The proposed mechanism works on principles of reverse combinatorial auction. We consider region multiple consumers who are willing to curtail their in peak hours order gain some incentives later. Using properties auctions, participants can bid p...

A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is to show that a rule satisfies a set of desirable axioms that uniquely identify it. Another is to show that the calculation that it performs is actually maximum likelihood estimation relative to a certain model of noise ...