13 research outputs found
Auctions with Heterogeneous Items and Budget Limits
We study individual rational, Pareto optimal, and incentive compatible
mechanisms for auctions with heterogeneous items and budget limits. For
multi-dimensional valuations we show that there can be no deterministic
mechanism with these properties for divisible items. We use this to show that
there can also be no randomized mechanism that achieves this for either
divisible or indivisible items. For single-dimensional valuations we show that
there can be no deterministic mechanism with these properties for indivisible
items, but that there is a randomized mechanism that achieves this for either
divisible or indivisible items. The impossibility results hold for public
budgets, while the mechanism allows private budgets, which is in both cases the
harder variant to show. While all positive results are polynomial-time
algorithms, all negative results hold independent of complexity considerations
Consistent Probabilistic Social Choice
Two fundamental axioms in social choice theory are consistency with respect
to a variable electorate and consistency with respect to components of similar
alternatives. In the context of traditional non-probabilistic social choice,
these axioms are incompatible with each other. We show that in the context of
probabilistic social choice, these axioms uniquely characterize a function
proposed by Fishburn (Rev. Econ. Stud., 51(4), 683--692, 1984). Fishburn's
function returns so-called maximal lotteries, i.e., lotteries that correspond
to optimal mixed strategies of the underlying plurality game. Maximal lotteries
are guaranteed to exist due to von Neumann's Minimax Theorem, are almost always
unique, and can be efficiently computed using linear programming
Mechanisms for Combinatorial Auctions with Budget Constraints
This paper studies combinatorial auctions with budget-constrained bidders from a mechanism design perspective. I search for mechanisms that are incentive compatible, individually rational, symmetric, non-wasteful and non-bossy. First focusing on the greedy domain, in which any increase in a bidder's valuation always exceeds his budget, I derive the unique mechanism, called the Iterative Second Price Auction. For the general domain, however, no such mechanism exists
International Conference on Continuous Optimization (ICCOPT) 2019 Conference Book
The Sixth International Conference on Continuous Optimization took place on the campus of the Technical University of Berlin, August 3-8, 2019. The ICCOPT is a flagship conference of the Mathematical Optimization Society (MOS), organized every three years. ICCOPT 2019 was hosted by the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) Berlin. It included a Summer School and a Conference with a series of plenary and semi-plenary talks, organized and contributed sessions, and poster sessions.
This book comprises the full conference program. It contains, in particular, the scientific program in survey style as well as with all details, and information on the social program, the venue, special meetings, and more
Multikonferenz Wirtschaftsinformatik (MKWI) 2016: Technische Universität Ilmenau, 09. - 11. März 2016; Band I
Ăśbersicht der Teilkonferenzen Band I:
• 11. Konferenz Mobilität und Digitalisierung (MMS 2016)
• Automated Process und Service Management
• Business Intelligence, Analytics und Big Data
• Computational Mobility, Transportation and Logistics
• CSCW & Social Computing
• Cyber-Physische Systeme und digitale Wertschöpfungsnetzwerke
• Digitalisierung und Privacy
• e-Commerce und e-Business
• E-Government – Informations- und Kommunikationstechnologien im öffentlichen Sektor
• E-Learning und Lern-Service-Engineering – Entwicklung, Einsatz und Evaluation technikgestützter Lehr-/Lernprozess
Fuelling the zero-emissions road freight of the future: routing of mobile fuellers
The future of zero-emissions road freight is closely tied to the sufficient availability of new and clean fuel options such as electricity and Hydrogen. In goods distribution using Electric Commercial Vehicles (ECVs) and Hydrogen Fuel Cell Vehicles (HFCVs) a major challenge in the transition period would pertain to their limited autonomy and scarce and unevenly distributed refuelling stations. One viable solution to facilitate and speed up the adoption of ECVs/HFCVs by logistics, however, is to get the fuel to the point where it is needed (instead of diverting the route of delivery vehicles to refuelling stations) using "Mobile Fuellers (MFs)". These are mobile battery swapping/recharging vans or mobile Hydrogen fuellers that can travel to a running ECV/HFCV to provide the fuel they require to complete their delivery routes at a rendezvous time and space. In this presentation, new vehicle routing models will be presented for a third party company that provides MF services. In the proposed problem variant, the MF provider company receives routing plans of multiple customer companies and has to design routes for a fleet of capacitated MFs that have to synchronise their routes with the running vehicles to deliver the required amount of fuel on-the-fly. This presentation will discuss and compare several mathematical models based on different business models and collaborative logistics scenarios